|
Search: id:A128117
|
|
|
| A128117 |
|
At the n-th iteration the sequence of integers from 1 to n are appended to the sequence a(n) times. |
|
+0
2
|
|
| 1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Reed Kelly (math(AT)keldesign.com), Feb 15 2007, Table of n, a(n) for n = 1..371
|
|
EXAMPLE
|
a(5) = 2 so 1,2,3,4,5,1,2,3,4,5 is added to the end of the sequence at the fifth iteration.
|
|
MATHEMATICA
|
cr[n_] := Module[ { A = {1, 1, 2}, i, j }, For [ i = 3, i <= n, i++, A = Join[ A, Flatten[ Table[ Range[i], {A[[i]]} ]]]; ]; A ]
|
|
CROSSREFS
|
Sequence in context: A036043 A128628 A098053 this_sequence A023115 A061336 A057945
Adjacent sequences: A128114 A128115 A128116 this_sequence A128118 A128119 A128120
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Reed Kelly (math(AT)keldesign.com), Feb 15 2007
|
|
|
Search completed in 0.002 seconds
|
