id:A118953 - OEIS Search Results

Search: id:A118953

Displaying 1-1 of 1 results found.

page 1

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

+0
5

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; listen)

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

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research