|
|
|
|
0, 1, 2, 2, 5, 4, 11, 4, 4, 10, 23, 8, 47, 22, 8, 8, 95, 8, 191, 20, 20, 46, 383, 16, 9, 94, 8, 44, 767, 16, 1535, 16, 44, 190, 17, 16, 3071, 382, 92, 40, 6143, 40, 12287, 92, 16, 766, 24575, 32, 19, 18, 188, 188, 49151, 16, 41, 88, 380, 1534, 98303, 32, 196607, 3070, 40, 32, 89, 88, 393215, 380, 764, 34, 786431, 32, 1572863, 6142, 16, 764
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Base-2 expansion of a(n) encodes the steps where numbers that are neither multiples of 2 nor 3 are encountered when map x -> A252463(x) is iterated down to 1, starting from x=n. An exception is the most significant bit of a(n) which corresponds with the final 1, but is shifted one bit-position towards right.
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A252463(n)) + [n = -1 or +1 (mod 6)].
Also, for n > 2, a(n) = 2*a(A252463(n)) + [n == 1 (mod 2)]*[abs(J(3|n)) == 1], where J is the Jacobi-symbol, and [ ]'s are Iverson brackets, whose product gives 1 only if n is an odd number for which J(3|n) = +1 or -1, and 0 otherwise.
|
|
PROG
|
(Scheme, two implementations)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|