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!)
A258483 Numbers n such that partial sums of the n-th row of the Pascal triangle (A007318) are all nonprime. 1

%I #25 Jan 02 2023 12:30:51

%S 0,9,29,33,34,37,38,39,41,45,49,65,67,69,73,74,77,85,86,92,97,98,101,

%T 105,113,114,115,117,118,121,129,133,134,137,139,141,145,146,151,154,

%U 155,158,160,161,164,165,170,173,177,182,185,186,193,194,195,199,202,205,206,209,213,214,225,227,229,230,234,241,247,257,258,259,261,263,265,266,269,272,273,277,281

%N Numbers n such that partial sums of the n-th row of the Pascal triangle (A007318) are all nonprime.

%C It appears that a(n) ~ c*n, as n goes to infinity, where c is constant < 2.17. For heuristic argument, see _Robert Israel_ link.

%H Peter J. C. Moses, <a href="/A258483/b258483.txt">Table of n, a(n) for n = 0..2499</a>

%H Robert Israel, <a href="http://list.seqfan.eu/oldermail/seqfan/2015-June/014940.html">Re: a surprising property</a>, SeqFan list, Jun 01 2015.

%p T:= <1>:

%p res:= 0:

%p for n from 1 to 1000 do

%p T:= <1, T[1..-2] + T[2..-1], 2^n>;

%p if not ormap(isprime,T) then res:= res, n fi

%p od:

%p res; # _Robert Israel_, Jun 04 2015

%o (PARI) isok(n) = {my(s = 0); for (k=0, n, s += binomial(n, k); if (isprime(s), return (0))); return (1);} \\ _Michel Marcus_, May 31 2015

%Y Cf. A007318, A008949, A258126, A258127.

%K nonn

%O 0,2

%A _Vladimir Shevelev_, May 31 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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)