|
| |
|
|
A207016
|
|
a(1) = 3 , for n > 1 a(n) is the least number greater than a(n-1) such that the Hamming distance D(a(n-1),a(n)) = 3.
|
|
4
|
|
|
|
3, 4, 9, 14, 18, 21, 24, 31, 39, 41, 46, 50, 53, 56, 63, 79, 83, 84, 89, 94, 102, 104, 111, 115, 116, 121, 126, 158, 166, 168, 175, 179, 180, 185, 190, 206, 210, 213, 216, 223, 231, 233, 238, 242, 245, 248, 255, 319, 335, 339, 340, 345, 350, 358, 360, 367, 371
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Odious and evil terms are alternating (cf. A000069, A001969).
|
|
|
LINKS
|
Alois P. Heinz, Table of n, a(n) for n = 1..1000
|
|
|
PROG
|
(PARI) list(n)=my(v=vector(n)); v[1]=3; for(i=2, n, v[i]=v[i-1]; while(hamming(bitxor(v[i-1], v[i]++))!=3, )); v \\ Charles R Greathouse IV, Mar 26 2013
|
|
|
CROSSREFS
|
Cf. A000225, A205509, A205510, A205511, A205302, A205649, A205533, A122565, A206852, A206853.
Sequence in context: A151517 A219043 A050163 * A095292 A007293 A014596
Adjacent sequences: A207013 A207014 A207015 * A207017 A207018 A207019
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Vladimir Shevelev, Feb 14 2012
|
|
|
STATUS
|
approved
|
| |
|
|
