|
Search: id:A065084
|
|
|
| A065084 |
|
Smallest prime having alternating bit sum (A065359) equal to n. |
|
+0
1
|
|
| 3, 7, 5, 0, 277, 1109, 0, 17749, 70997, 0, 1398037, 5526869, 0, 72701269
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Only 3d = 11b has an alternating sum of 0, and alternated sums of 3*k are impossible for primes.
|
|
MATHEMATICA
|
f[n_] := (d = Reverse[ IntegerDigits[n, 2]]; l = Length[d]; s = 0; k = 1; While[k < l + 1, s = s - (-1)^k*d[[k]]; k++ ]; s); a = Table[ f[ Prime[n]], {n, 1, 10^6} ]; b = Table[0, {13} ];
Do[ If[ a[[n]] > -1 && b[[a[[n]] + 1]] == 0, b[[a[[n]] + 1]] = Prime[n]], {n, 1, 10^6} ]; b
|
|
CROSSREFS
|
Cf. A065359.
Sequence in context: A023639 A086242 A096627 this_sequence A132742 A021910 A094124
Adjacent sequences: A065081 A065082 A065083 this_sequence A065085 A065086 A065087
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 09 2001
|
|
|
Search completed in 0.002 seconds
|
