Consider the decimal expansion of :
Notice that those numbers in units of three digits - let's call them - satisfy .
If and , find the least for which the recurrence is no longer satisfied.
Inspired by this problem .
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.
The series { a n } is nothing but the tribonacci series, and its generating function is given by: f ( z ) = 1 − z − z 2 − z 3 z = n = 1 ∑ ∞ a n ⋅ z n
1/998998999 = f ( 1 0 0 0 1 ) = 0. 000 000 001 001 002 004 ....
The 13th tribonacci number = 927 and after that, you have 4 digit tribonacci numbers. But because there are only places for 3 digits, the carry of the next tribonacci (1705) gets added to the units of 927, making it 928. So, the sequence stops there at n=13.