Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A164677
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
1
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 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Absolute values give A001511

Sequence in context: A111376 A157226 A156249 this_sequence A001511 A065704 A026100

Adjacent sequences: A164674 A164675 A164676 this_sequence A164678 A164679 A164680

KEYWORD

easy,sign

AUTHOR

Arie Bos (arie.0.bos(AT)gmail.com), Aug 20 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 22 15:28 EST 2009. Contains 167310 sequences.


AT&T Labs Research