|
Search: id:A064065
|
|
|
| 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. |
|
+0
4
|
|
| 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; listen)
|
|
|
OFFSET
|
0,5
|
|
|
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
|
Each positive number appears an infinite number of times: e.g. a(k)=1 whenever k-1 is in A006894. Cf. A064064, A064066, A064067.
Sequence in context: A068796 A154804 A053276 this_sequence A054705 A025800 A029258
Adjacent sequences: A064062 A064063 A064064 this_sequence A064066 A064067 A064068
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Aug 31 2001
|
|
|
Search completed in 0.002 seconds
|
