A085246 -id:A085246 - cp's OEIS frontend

A085262 Indices of nonzero terms of A085246, where a(n+2)=a(n+1)+A085246(n)+1 and a(2^(n-1)+1)=2^n.

1, 2, 4, 7, 8, 12, 13, 14, 16, 21, 22, 23, 24, 26, 28, 31, 32, 38, 39, 40, 41, 42, 44, 46, 48, 51, 52, 55, 56, 60, 61, 62, 64, 71, 72, 73, 74, 75, 76, 78, 80, 82, 84, 87, 88, 91, 92, 95, 96, 100, 101, 102, 104, 108, 109, 110, 112, 117, 118, 119, 120, 122, 124, 127, 128, 136

Offset: 1

Paul D. Hanna, Aug 22 2003

nonn

A self-describing sequence. Pick any integer n; this n says: "There are n terms in the sequence which are < 2n". The slowest increasing such sequence is A094591. - Eric Angelini, Jun 15 2007

Cf. A085246.

A087157 Satisfies a(1)=1, a(A087158(n+1)) = a(n)+1, with a(m)=1 for all m not found in A087158, where A087158(n+2)=A087158(n+1)+a(n)+1.

Original entry on oeis.org

1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 5, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 6, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1

Offset: 1

Paul D. Hanna, Aug 22 2003

nonn

Removing all the 1's results in the original sequence with every term incremented by 1.

			Initialize all terms to 1. Set a(1)=1, go one term forward,
set a(2)=a(1)+1=2, go 2 terms forward,
set a(4)=a(2)+1=3, go 3 terms forward,
set a(7)=a(3)+1=2, go 2 terms forward,
set a(9)=a(4)+1=4, go 4 terms forward,
set a(13)=a(5)+1=1, etc.
The indices 1,2,4,7,9,13,... form A087158.

Cf. A087158, A085246.

Records are given by A055588(n): a(A055588(n))=n, where A055588(n)=Fibonacci(2n-2)+1 and Fibonacci(n)=A000045(n).

cp's OEIS Frontend

A085262 Indices of nonzero terms of A085246, where a(n+2)=a(n+1)+A085246(n)+1 and a(2^(n-1)+1)=2^n.

Views

Author

Keywords

Comments

Crossrefs