Let be a monotone increasing sequences of non negative integers. The sequence has the property, that each non-negative integer has a unique representation in the form of
don't have to be distinct.
Let x be the number of sequences that suffice the given property above.
Compute
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!