A118953 - OEIS

This site is supported by donations to The OEIS Foundation.

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 (list; graph; refs; listen; history; internal format)

	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: A093383 A093384 A080584 * A023970 A072626 A011659` `Adjacent sequences: A118950 A118951 A118952 * A118954 A118955 A118956`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 07 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:14 EST 2012. Contains 205694 sequences.