login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085246 Satisfies a(1)=1, a(A026835(n+1)) = a(n)+1, with a(m)=0 for all m not found in A026835, where A026835(n+2)=A026835(n+1)+a(n)+1. 2
1, 2, 0, 3, 0, 0, 1, 4, 0, 0, 0, 1, 1, 2, 0, 5, 0, 0, 0, 0, 1, 1, 1, 2, 0, 2, 0, 3, 0, 0, 1, 6, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 0, 2, 0, 2, 0, 3, 0, 0, 1, 3, 0, 0, 1, 4, 0, 0, 0, 1, 1, 2, 0, 7, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 0, 2, 0, 2, 0, 2, 0, 3, 0, 0, 1, 3, 0, 0, 1, 3, 0, 0, 1, 4, 0, 0, 0, 1, 1, 2, 0, 4, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Removing the leading '1' and all zeros results in the original sequence with every term incremented by 1.

LINKS

Table of n, a(n) for n=1..105.

FORMULA

Records occur at 2^n: a(2^n)=n+1.

EXAMPLE

Initialize all terms to zero. 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=1, go 1 term forward,

set a(8)=a(4)+1=4, go 4 terms forward,

set a(12)=a(5)+1=1, etc.

The indices 1,2,4,7,8,12,... form A085262.

CROSSREFS

Cf. A085262.

Sequence in context: A261727 A234579 A109362 * A268726 A035182 A280720

Adjacent sequences:  A085243 A085244 A085245 * A085247 A085248 A085249

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Aug 22 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 24 19:48 EDT 2019. Contains 321448 sequences. (Running on oeis4.)