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!)
A258126 Smallest prime of the form Sum_{i=0..k} binomial(n,i), or a(n)=0 if there is no such a prime. 4

%I #19 Jul 01 2015 20:15:27

%S 2,3,7,5,31,7,29,37,0,11,67,13,1093,1471,9949,17,131071,19,191,211,

%T 7547,23,277,190051,1807781,61450327,379,29,0,31,36457,1149017,0,0,

%U 631,37,0,0,0,41,0,43,947,991,0,47,1129,8682997471,0,1125899906842573,1327,53

%N Smallest prime of the form Sum_{i=0..k} binomial(n,i), or a(n)=0 if there is no such a prime.

%C a(n)=0 for n=9,29,33,34,37,38,39,41,45,49,...;

%C records a(n) are on the positions: 1,2,3,5,8,11,13,14,15,17,24,25,26,48,50,...

%C Mersenne primes a(n) = 2^n-1 are at positions 2,3,5,17,...

%H Peter J. C. Moses, <a href="/A258126/b258126.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) <= 2^n-1.

%o (PARI) a(n) = {my(k = 0); while(! isprime(p=sum(i=0, k, binomial(n,i))), k++; if ((k>n) && !isprime(binomial(n,k)), return (0);)); p;} \\ _Michel Marcus_, May 23 2015

%Y Cf. A007318, A258127.

%K nonn

%O 1,1

%A _Vladimir Shevelev_, May 21 2015

%E More terms from _Peter J. C. Moses_, May 21 2015

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 July 27 13:23 EDT 2024. Contains 374647 sequences. (Running on oeis4.)