login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #3 Mar 30 2012 18:50:54

%S 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,

%T 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,

%U 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

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

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

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

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

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, May 07 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)