A118953 Number of ways to write the n-th prime as 2^k + p, where p is prime and p < 2^k.

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)).

Links

Table of n, a(n) for n=1..105.

Crossrefs

Sequence in context: A093384 A080584 A316824 * A023970 A072626 A191153

Adjacent sequences: A118950 A118951 A118952 * A118954 A118955 A118956

Keyword

nonn

Author

Reinhard Zumkeller, May 07 2006

Status

approved