A240813 -id:A240813 - cp's OEIS frontend

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

6, 0, 164, 0, 60, 2354, 282, 1336, 100, 1254, 366, 419, 498, 483, 778, 1204, 292, 373, 845, 838, 1118, 2120, 815, 2616, 686, 1195, 745, 1112, 2132, 1588, 754, 1227, 1279, 1661, 716, 2275, 784, 2341, 1874, 1463, 1122, 2800, 1350, 1613, 2279, 1557, 1532

Offset: 1

T. D. Noe, Nov 06 2007

nonn

Such a sequence has finite length when the k-th term becomes greater than k.

The term a(2) = 0 is only conjectural - see A005185. a(4) = 0 is a theorem of Balamohan et al. (2007). - N. J. A. Sloane, Nov 07 2007, Apr 18 2014.

			a(1) = 6: the f-sequence is defined by f(1) = 1, f(n) = 2f(n-f(n-1)), which gives 1,2,2,4,2,8 but f(7) = 2f(-1) is undefined, so the length is 6.

Seiichi Manyama, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
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.
D. R. Hofstadter, Graph of first 21500 terms.
Index entries for Hofstadter-type sequences

Cf. A005185, A046700, A063882, A132172, A134679 (sequences for n=2..6).
See A240810 for another version.
A diagonal of the triangle in A240813.

Table[Clear[a]; a[n_] := a[n] = If[n<=k, 1, a[n-a[n-1]]+a[n-a[n-k]]]; t={1}; n=2; While[n<10000 && a[n-1]

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.

Original entry on oeis.org

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

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.

Original entry on oeis.org

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

N. J. A. Sloane, Apr 15 2014

nonn

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 = 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

See A240815 for another version.

A diagonal of the triangle in A240813.

More terms from Lars Blomberg, Oct 24 2014

cp's OEIS Frontend

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

Programs

Mathematica

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

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.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

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.

Views

Author

Keywords

References

Links

Crossrefs

Extensions