The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 3
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 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 A240815 for another version. A diagonal of the triangle in A240813. Sequence in context: A281085 A072270 A214025 * A291425 A180864 A206608 Adjacent sequences:  A240809 A240810 A240811 * A240813 A240814 A240815 KEYWORD nonn AUTHOR N. J. A. Sloane, Apr 15 2014 EXTENSIONS More terms from Lars Blomberg, Oct 24 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 18 03:46 EDT 2021. Contains 345098 sequences. (Running on oeis4.)