login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064065 n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=0, a(1)=1. 3
0, 1, 1, 1, 2, 1, 2, 2, 2, 3, 3, 3, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 3, 2, 3, 3, 3, 4, 3, 4, 2, 3, 3, 3, 4, 3, 4, 4, 3, 4, 4, 4, 5, 4, 5, 5, 5, 3, 4, 4, 4, 5, 4, 5, 5, 5, 6, 3, 4, 4, 4, 5, 4, 5, 5, 5, 6, 6, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 4, 4, 2, 3, 3, 3, 4, 3, 4, 4, 4, 5, 5, 5, 3, 2, 3, 3, 3, 4, 3, 4, 4, 4, 5, 5, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Each positive number appears an infinite number of times: e.g., a(k)=1 whenever k-1 is in A006894.

LINKS

Table of n, a(n) for n=0..104.

EXAMPLE

Start with (0,1). So after initial step have (0, *1*, 0+1 = 1), then (0, 1, *1*, 0+1 = 1, 1+1 = 2), then (0, 1, 1, *1*, 2, 0+1 = 1, 1+1 = 2, 1+1 = 2), then (0, 1, 1, 1, *2*, 1, 2, 2, 0+2 = 2, 1+2 = 3, 1+2 = 3, 1+2 = 3), etc.

CROSSREFS

Cf. A064064, A064066, A064067.

Sequence in context: A154804 A207642 A053276 * A284486 A232194 A054705

Adjacent sequences:  A064062 A064063 A064064 * A064066 A064067 A064068

KEYWORD

nonn

AUTHOR

Henry Bottomley, Aug 31 2001

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 January 23 19:45 EST 2020. Contains 331175 sequences. (Running on oeis4.)