|
| |
|
|
A122197
|
|
Fractal sequence: count up to successive integers twice.
|
|
4
| |
|
|
1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 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, 7, 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, 10, 1, 2, 3, 4, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| Fractal - deleting the first occurrence of each integer leaves the original sequence. Also, deleting the all 1's leaves the original sequence plus 1. New values occur at square indices. 1's occur at indices m^2+1 and m^2+m+1. Ordinal transform of A122196.
Except for its initial 1, A122197 is the natural fractal sequence of A002620; that is, A122197(n+1) is the number of the row of A194061 that contains n. See A194029 for definition of natural fractal sequence. [From Clark Kimberling, Aug 12 2011]
|
|
|
EXAMPLE
| 1, 1, 1,2, 1,2, 1,2,3, 1,2,3, etc.
|
|
|
CROSSREFS
| Cf. A122196, A000290, A033638, A002260.
Sequence in context: A121997 A023128 A023118 * A030718 A194066 A182628
Adjacent sequences: A122194 A122195 A122196 * A122198 A122199 A122200
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Frank Adams-Watters (FrankTAW(AT)Netscape.net), Aug 25 2006
|
| |
|
|
