login
A118953
Number of ways to write the n-th prime as 2^k + p, where p is prime and p < 2^k.
4
0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1
OFFSET
1,1
COMMENTS
0 <= a(n) <= 1, a(n) <= A078687(n);
a(A049084(A118958(n))) = 0, a(A049084(A091932(n))) = 1;
a(n) = A118952(A000040(n)).
CROSSREFS
Sequence in context: A093384 A080584 A316824 * A023970 A072626 A191153
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 07 2006
STATUS
approved