|
|
A164677
|
|
For a binary reflected Gray code, the (Hamming/Euclidean) distance between 2 subsequent points x and y is 1, say in coordinate k. If y has a 1 in coordinate k and x has a 0, than (x,y) is indicated by k, if it is the other way around, (x,y) is indicated by -k. The sequence has a fractal character such that G(d+1) = G(d) d+1 R(G(d)) where R(G(d)) alters d --> -d and leaves all other numbers invariant.
|
|
4
|
|
|
1, 2, -1, 3, 1, -2, -1, 4, 1, 2, -1, -3, 1, -2, -1, 5, 1, 2, -1, 3, 1, -2, -1, -4, 1, 2, -1, -3, 1, -2, -1, 6, 1, 2, -1, 3, 1, -2, -1, 4, 1, 2, -1, -3, 1, -2, -1, -5, 1, 2, -1, 3, 1, -2, -1, -4, 1, 2, -1, -3, 1, -2, -1, 7, 1, 2, -1, 3, 1, -2, -1, 4, 1, 2, -1, -3, 1, -2, -1, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This is the paper-folding sequence Fold(1,2,3,4,5,...). It is also the fixed point of the map 1->1,2; 2->-1,3; 3->-1,4; 4->-1,5; ...; -1->1,-2; -2->-1,-3; -3->-1,-4; -4->-1,-5; ... [Allouche and Shallit]. - N. J. A. Sloane, Jul 27 2012
|
|
REFERENCES
|
J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003, p. 203, Exercise 15.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
a[n_] := KroneckerSymbol[-1, n] * IntegerExponent[2n, 2];
|
|
PROG
|
(PARI) A164677(n)=(valuation(n, 2)+1)*if(n>>valuation(n, 2)%4==3, -1, 1) \\ M. F. Hasler, Aug 06 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,sign,mult
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|