login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A240820
a(n) = length (or lifetime) of the meta-Fibonacci sequence f(k) = k for k <= n; f(k) = f(k-f(k-3)) + f(k-f(k-n)) if that sequence is only defined for finitely many terms, or 0 if that sequence is infinite.
3
20, 71, 34, 0, 46, 34, 36, 39, 90, 0, 142, 70, 91, 94, 255, 2004, 306, 525, 259, 454, 304, 1866, 316, 198, 254, 297, 415, 3315, 348, 406, 397, 420, 903, 1226, 408, 589, 1294, 535, 490, 958, 1343, 477, 492, 915, 1378, 1723, 797, 1869, 745, 696, 863, 1070, 560
OFFSET
3,1
COMMENTS
The term a(6) = 0 is only conjectural.
REFERENCES
D. R. Hofstadter, Curious patterns and non-patterns in a family of meta-Fibonacci recursions, Lecture in Doron Zeilberger's Experimental Mathematics Seminar, Rutgers University, April 10 2014.
LINKS
Lars Blomberg, Table of n, a(n) for n = 3..10000, "infinity" = 10^8.
D. R. Hofstadter, Curious patterns and non-patterns in a family of meta-Fibonacci recursions, Lecture in Doron Zeilberger's Experimental Mathematics Seminar, Rutgers University, April 10 2014; Part 1, Part 2.
CROSSREFS
See A240827 for the sequence for n=6.
See A240823 for another version.
A diagonal of the triangle in A240821.
Sequence in context: A303609 A052516 A083873 * A143854 A263969 A139241
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 15 2014
EXTENSIONS
More terms from Lars Blomberg, Oct 24 2014
STATUS
approved