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

Author

Reinhard Zumkeller, May 07 2006

Keywords

• nonn

Comments

0 <= a(n) <= 1, a(n) <= A078687(n);

a(A049084(A118958(n))) = 0, a(A049084(A091932(n))) = 1;

a(n) = A118952(A000040(n)).