A240812 a(n) = length (or lifetime) of the meta-Fibonacci sequence f(1) = ... = f(n) = 1; 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.

13, 10, 11, 13, 44, 31, 49, 38, 80, 58, 69, 61, 57, 60, 63, 78, 81, 85, 81, 84, 87, 96, 99, 109, 105, 108, 111, 120, 123, 126, 129, 132, 135, 138, 141, 144, 153, 156, 159, 162, 165, 168, 177, 180, 183, 186, 189, 192, 201, 204, 207, 210, 213, 216, 225, 228, 231

Offset: 3

Author

N. J. A. Sloane, Apr 15 2014

Keywords

• nonn

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.
• Index entries for Hofstadter-type sequences

Crossrefs

See A240815 for another version.

A diagonal of the triangle in A240813.

Extensions

More terms from Lars Blomberg, Oct 24 2014