|
Search: id:A088748
|
|
| |
|
| 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 5, 4, 3, 4, 3, 2, 3, 4, 5, 4, 5, 6, 5, 4, 3, 4, 5, 4, 3, 4, 3, 2, 3, 4, 5, 4, 5, 6, 5, 4, 5, 6, 7, 6, 5, 6, 5, 4, 3, 4, 5, 4, 5, 6, 5, 4, 3, 4, 5, 4, 3, 4, 3, 2, 3, 4, 5, 4, 5, 6, 5, 4, 5, 6, 7, 6, 5, 6, 5, 4, 5, 6, 7, 6, 7, 8, 7, 6, 5, 6, 7, 6, 5, 6, 5, 4, 3, 4, 5, 4, 5, 6
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Let s(0)=1; s(n+1)=s(n),ri(n), where ri(n) is s(n) reversed and incremented. Each s(n) is an initial part of this sequence.
For each m, a(1 to 2^m) is a permutation of A063787(1 to 2^m). For k=1 to 2^m, a(2^m+1-A088372(m,k)) = A063787(k).
Sequence can be generated from the dragon curve A014577.
Partial sums of the sequence = A164910: (1, 3, 6, 8, 11, 15, 20,...).
a(0) = 1, then using the dragon curve sequence A014577: (1, 1, 0, 1, 1,...) as a code: (1 = add to current term, 0 = subtract from current term, to get the next term)
Rows of A088696 tend to this sequence..
|
|
EXAMPLE
|
The first 8 terms of the sequence = (1, 2, 3, 2, 3, 4, 3, 2), where the first
four terms = (1, 2, 3, 2). Reverse, add 1, getting (3, 4, 3, 2), then append.
The sequence begins with "1", then using the dragon curve coding, we get:
1...2...3...2...3...4... = A088748
....1...1...0...1...1... = A014577, the dragon curve.
|
|
CROSSREFS
|
Cf. A014577, A063787, A088208, A088372, A088696/
Sequence in context: A130799 A106383 A105500 this_sequence A086374 A123182 A069464
Adjacent sequences: A088745 A088746 A088747 this_sequence A088749 A088750 A088751
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 14 2003
|
|
EXTENSIONS
|
Edited by Don Reble (djr(AT)nk.ca), Nov 15 2005
Additional comments from Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 30 2009
Edited by N. J. A. Sloane, Sep 06 2009
|
|
|
Search completed in 0.002 seconds
|
