|
Search: id:A139124
|
|
|
| A139124 |
|
Starting from 1, at any step count the number of appearances of k, where k ranges from the highest number to 1. |
|
+0
1
|
|
| 1, 1, 2, 1, 2, 2, 3, 1, 3, 3, 3, 3, 4, 1, 5, 3, 4, 1, 2, 6, 3, 5, 1, 2, 2, 7, 4, 6, 1, 2, 2, 3, 7, 6, 7, 3, 3, 2, 3, 8, 8, 8, 3, 3, 3, 2, 3, 11, 9, 8, 1, 0, 1, 4, 3, 3, 2, 3, 15, 10, 8, 1, 0, 0, 0, 1, 1, 1, 5, 3, 3, 2, 4, 18, 11, 10, 1, 0, 0, 1, 0, 0, 0, 2, 2, 1, 5, 5, 20, 12, 14, 1, 0, 1, 0, 0, 1, 1, 0, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
Start from 1. There is just one 1. So the sequence becames 1,1. Then count two 1s.
So we have 1,1,2. Then one 2 and two 1 -> 1,1,2,1,2. Then two 2 and three 1 -> 1,1,2,1,2,2,3. Then one 3, three 2, three 1 -> 1,1,2,1,2,2,3,1,3,3. Then three 3, three 2 and four 1 -> 1,1,2,1,2,2,3,1,3,3,3,3,4. And so on.
|
|
CROSSREFS
|
Cf. A030717.
Sequence in context: A000374 A120562 A033666 this_sequence A024160 A103284 A071287
Adjacent sequences: A139121 A139122 A139123 this_sequence A139125 A139126 A139127
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Apr 15 2008
|
|
|
Search completed in 0.002 seconds
|
