|
Search: id:A086638
|
|
|
| A086638 |
|
Numbers with no 11 or 000 in their binary expansion. |
|
+0
1
|
|
| 0, 1, 2, 4, 5, 9, 10, 18, 20, 21, 36, 37, 41, 42, 73, 74, 82, 84, 85, 146, 148, 149, 164, 165, 169, 170, 292, 293, 297, 298, 329, 330, 338, 340, 341, 585, 586, 594, 596, 597, 658, 660, 661, 676, 677, 681, 682, 1170, 1172, 1173
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The number of n-bit numbers in this sequence for n>1 is given by a(n+6) where a is the Padovan sequence A000931.
|
|
PROGRAM
|
(Python: Replace leading dots by blanks, put these lines in a file, say A086638.py and run "python A086638.py | more". Be careful, the object A086638() is almost infinitely long.)
def A086638():
... yield 0
... for x in A086638():
....... if x & 3:
........... yield 2*x
....... if not (x & 1):
........... yield 2*x+1
........................ [blank line]
for x in A086638():
... print x
........................ [blank line]
|
|
CROSSREFS
|
Cf. A000931.
Sequence in context: A071349 A039891 A070924 this_sequence A098845 A069001 A047378
Adjacent sequences: A086635 A086636 A086637 this_sequence A086639 A086640 A086641
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
David Eppstein (eppstein(AT)ics.uci.edu), Sep 14 2003
|
|
|
Search completed in 0.002 seconds
|
