|
Search: id:A064064
|
|
|
| A064064 |
|
n-th step is to add a(n) to each previous number a(k) (including itself, i.e. k<=n) to produce n+1 more terms of the sequence, starting with a(0)=1. |
|
+0
4
|
|
| 1, 2, 3, 4, 4, 5, 6, 5, 6, 7, 8, 5, 6, 7, 8, 8, 6, 7, 8, 9, 9, 10, 7, 8, 9, 10, 10, 11, 12, 6, 7, 8, 9, 9, 10, 11, 10, 7, 8, 9, 10, 10, 11, 12, 11, 12, 8, 9, 10, 11, 11, 12, 13, 12, 13, 14, 9, 10, 11, 12, 12, 13, 14, 13, 14, 15, 16, 6, 7, 8, 9, 9, 10, 11, 10, 11, 12, 13, 10, 7, 8, 9, 10, 10
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
Start with (1). So after initial step have (*1*,1+1=2), then (1,*2*,1+2=3,2+2=4), then (1,2,*3*,4,1+3=4,2+3=5,3+3=6), then (1,2,3,*4*,4,5,6,1+4=5,2+4=6,3+4=7,4+4=8), then (1,2,3,4,*4*,5,6,5,6,7,8,1+4=5,2+4=6,3+4=7,4+4=8,4+4=8) etc.
|
|
CROSSREFS
|
Each number eventually appears A001190 times (binary rooted trees can be constructed by combining earlier trees in a similar manner with the n-th tree having a(n) end points). Cf. A064065, A064066, A064067.
Adjacent sequences: A064061 A064062 A064063 this_sequence A064065 A064066 A064067
Sequence in context: A051898 A092032 A058222 this_sequence A101504 A125568 A108872
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Aug 31 2001
|
|
|
Search completed in 0.002 seconds
|
