|
|
A356248
|
|
Image of 1 under repeated application of the map k -> (2k-1,2k,2k-1).
|
|
0
|
|
|
1, 2, 1, 3, 4, 3, 1, 2, 1, 5, 6, 5, 7, 8, 7, 5, 6, 5, 1, 2, 1, 3, 4, 3, 1, 2, 1, 9, 10, 9, 11, 12, 11, 9, 10, 9, 13, 14, 13, 15, 16, 15, 13, 14, 13, 9, 10, 9, 11, 12, 11, 9, 10, 9, 1, 2, 1, 3, 4, 3, 1, 2, 1, 5, 6, 5, 7, 8, 7, 5, 6, 5, 1, 2, 1, 3, 4, 3, 1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
If A(n) = (a(0),a(1),...,a(3^n-1)), then A(n+1) = (A(n),2^n+A(n),A(n)).
|
|
EXAMPLE
|
1 --> 1 2 1 --> 1 2 1 3 4 3 1 2 1 --> 1 2 1 3 4 3 1 2 1 5 6 5 7 8 7 5 6 5 1 2 1 3 4 3 1 2 1 -->...
|
|
PROG
|
(Python)
def aupton(terms):
a, n = [1], 0
while len(a) < 3*terms: a, n = a + [(1<<n) + ai for ai in a] + a, n+1
return a[:terms]
(PARI) a(n) = fromdigits(digits(n, 3)%2, 2) + 1; \\ Kevin Ryde, Jul 31 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|