This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; 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)). LINKS 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 26 04:11 EDT 2019. Contains 324369 sequences. (Running on oeis4.)