A240814 -id:A240814 - cp's OEIS frontend

A240816 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = index of first nonexisting term of the meta-Fibonacci sequence {f(1) = ... = f(n) = 1; f(i)=f(i-f(i-k))+f(i-f(i-n))} if that sequence is only defined for finitely many terms, or 0 if that sequence is infinite.

7, 0, 15, 165, 55, 14, 0, 0, 11, 12, 61, 38, 12, 13, 14, 2355, 31, 14, 14, 15, 16, 283, 64, 45, 15, 16, 18, 19, 1337, 369, 32, 16, 18, 19, 20

Offset: 1

N. J. A. Sloane, Apr 15 2014

The zero entries (except T(4,1)) are only conjectural.

Apart from the zero entries, equals A240813 + 1.

			Triangle begins:
     7;
     0,  15;
   165,  55, 14;
     0,   0, 11, 12;
    61,  38, 12, 13, 14;
  2355,  31, 14, 14, 15, 16;
   283,  64, 45, 15, 16, 18, 19;
  1337, 369, 32, 16, 18, 19, 20, ?;
  ...

B. Balamohan, A. Kuznetsov and S. Tanny, On the behavior of a variant of Hofstadter's Q-sequence, J. Integer Sequences, Vol. 10 (2007), #07.7.1.
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

Diagonals give A240810, A240814, A240815.

See A240813 for another version.

A240811 a(n) = length (or lifetime) of the meta-Fibonacci sequence f(1) = ... = f(n) = 1; f(k)=f(k-f(k-2))+f(k-f(k-n)) if that sequence is only defined for finitely many terms, or 0 if that sequence is infinite.

Original entry on oeis.org

14, 54, 0, 37, 30, 63, 368, 47, 46, 108, 188, 118, 62, 209, 126, 197, 78, 127, 190, 141, 94, 130, 138, 226, 110, 134, 158, 138, 126, 170, 242, 371, 142, 190, 178, 225, 158, 206, 214, 304, 174, 226, 238, 245, 190, 250, 262, 328, 206, 234, 278, 357, 222, 290

Offset: 2

N. J. A. Sloane, Apr 15 2014

nonn

The term a(4) = 0 is only conjectural.

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.

Lars Blomberg, Table of n, a(n) for n = 2..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.
D. R. Hofstadter, Graph of first 100 terms
Index entries for Hofstadter-type sequences

Cf. A063892, A087777, A240817 (sequences for n=3..5).
See A240814 for another version.
A diagonal of the triangle in A240813.

More terms from Lars Blomberg, Oct 24 2014

cp's OEIS Frontend

A240816 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = index of first nonexisting term of the meta-Fibonacci sequence {f(1) = ... = f(n) = 1; f(i)=f(i-f(i-k))+f(i-f(i-n))} if that sequence is only defined for finitely many terms, or 0 if that sequence is infinite.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs