|
Search: id:A120385
|
|
|
| A120385 |
|
If a(n-1) = 1 then largest value so far + 1, otherwise floor(a(n-1)/2); or table T(n,k) with T(n,0) = n, T(n,k+1) = floor(T(n,k)/2). |
|
+0
2
|
|
| 1, 2, 1, 3, 1, 4, 2, 1, 5, 2, 1, 6, 3, 1, 7, 3, 1, 8, 4, 2, 1, 9, 4, 2, 1, 10, 5, 2, 1, 11, 5, 2, 1, 12, 6, 3, 1, 13, 6, 3, 1, 14, 7, 3, 1, 15, 7, 3, 1, 16, 8, 4, 2, 1, 17, 8, 4, 2, 1, 18, 9, 4, 2, 1, 19, 9, 4, 2, 1, 20, 10, 5, 2, 1, 21, 10, 5, 2, 1, 22, 11, 5, 2, 1, 23, 11, 5, 2, 1, 24, 12, 6, 3, 1, 25
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Although not strictly a fractal sequence as defined in the Kimberling link, this sequence has many fractal properties. If the first instance of each value is removed, the result is the original sequence with each row repeated twice. Removing all odd index instances of each value does give the original sequence.
|
|
LINKS
|
C. Kimberling, Fractal sequences
|
|
FORMULA
|
T(n,k) = floor(n/2^(k-1))
|
|
EXAMPLE
|
The table starts:
1
2,1
3,1
4,2,1
5,2,1
6,3,1
7,3,1
8,4,2,1
|
|
CROSSREFS
|
Cf. A029837 (row lengths), A083652 (position of first n).
Cf. A005187 (row sums).
Sequence in context: A088242 A113398 A056538 this_sequence A132460 A067734 A067004
Adjacent sequences: A120382 A120383 A120384 this_sequence A120386 A120387 A120388
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 29 2006
|
|
|
Search completed in 0.002 seconds
|
