A095771 -id:A095771 - cp's OEIS frontend

A095769 a(1)=a(2)=1; a(n)=a(a(a(a(n-1))))+a(n-a(a(a(n-1)))).

1, 1, 2, 3, 4, 4, 5, 6, 6, 7, 8, 9, 9, 10, 11, 11, 12, 13, 13, 14, 15, 16, 17, 17, 17, 18, 19, 19, 20, 21, 22, 23, 24, 25, 26, 26, 26, 26, 27, 28, 28, 29, 30, 31, 31, 32, 33, 34, 35, 36, 37, 38, 39, 39, 39, 39, 39, 40, 41, 41, 42, 43, 44, 45, 46, 47, 47, 48, 48, 48, 49, 50, 51, 52

Offset: 1

Benoit Cloitre, Jun 05 2004

nonn

A generalization of A004001.

J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.

Cf. A004001, A093878, A095770, A095771.

v=vector(150,j,1);for(n=3,150,g=v[v[v[v[n-1]]]]+v[n-v[v[v[n-1]]]];v[n]=g);a(n)=v[n]

For n > 1, a(A000930(n)) = A000930(n-1).

Conjecture: lim_{n->oo} a(n)/n = 0.682327803828... (the real positive root of x^3 + x = 1).

A095770 First differences of A095769.

Original entry on oeis.org

0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0

Offset: 1

Benoit Cloitre, Jun 05 2004

nonn

J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.

Cf. A004001, A093878, A095769, A095771.

v=vector(150,j,1);for(n=3,150,g=v[v[v[v[n-1]]]]+v[n-v[v[v[n-1]]]];v[n]=g);a(n)=v[n+1]-v[n]

cp's OEIS Frontend

A095769 a(1)=a(2)=1; a(n)=a(a(a(a(n-1))))+a(n-a(a(a(n-1)))).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula