Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085246
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
3
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; listen)
OFFSET

1,2

COMMENT

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

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: A035199 A035229 A109362 this_sequence A035182 A141700 A035205

Adjacent sequences: A085243 A085244 A085245 this_sequence A085247 A085248 A085249

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 22 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research