|
Search: id:A163496
|
|
|
| A163496 |
|
a(n) = the number of distinct primes that can be made by writing n in binary, doubling any number (possibly zero) of 1's in place in this binary representation, and converting back to decimal. |
|
+0
1
|
|
| 1, 1, 2, 0, 3, 0, 2, 0, 1, 0, 3, 0, 4, 0, 2, 0, 1, 0, 3, 0, 4, 0, 4, 0, 0, 0, 2, 0, 4, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 5, 0, 5, 0, 3, 0, 4, 0, 3, 0, 3, 0, 4, 0, 4, 0, 1, 0, 4, 0, 5, 0, 1, 0, 2, 0, 2, 0, 4, 0, 2, 0, 3, 0, 3, 0, 4, 0, 3, 0, 3, 0, 6, 0, 5, 0, 6, 0, 3, 0, 7, 0, 5, 0, 4, 0, 1, 0, 4, 0, 4, 0, 4, 0, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
a(2n) = 0 , for all n >= 2.
|
|
EXAMPLE
|
13 in binary is 1101. The distinct binary numbers that can be made by doubling any number of 1's are: 1101 (13 in decimal), 11011 (doubling the rightmost 1, getting 27 in decimal), 11101 (29), 111101 (61), 111011 (59), and 1111011 (123). Of these, four are primes (13, 29, 61, 59). So, a(13) = 4.
|
|
CROSSREFS
|
Sequence in context: A035614 A133735 A095704 this_sequence A092241 A128144 A128145
Adjacent sequences: A163493 A163494 A163495 this_sequence A163497 A163498 A163499
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jul 29 2009
|
|
EXTENSIONS
|
More terms from Sean A. Irvine (sairvin(AT)xtra.co.nz), Oct 11 2009
|
|
|
Search completed in 0.002 seconds
|
