The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A219635 a(n) is the smallest number > a(n-1) such that 1 + a(1)^3 + a(2)^3 + ... + a(n)^3 is a prime. 0

%I #9 Sep 14 2017 03:53:23

%S 1,3,8,12,18,22,24,36,44,52,60,66,74,102,112,116,124,134,136,156,224,

%T 234,246,304,312,320,340,374,390,396,402,426,450,460,522,528,554,568,

%U 588,612,632,640,654,660,686,700,704,706,710,718,762,764,772,788,846

%N a(n) is the smallest number > a(n-1) such that 1 + a(1)^3 + a(2)^3 + ... + a(n)^3 is a prime.

%C The corresponding primes are 2, 29, 541, 2269, 8101, 18749, 32573,...

%e a(1) = 1 because 1 + 1^3 = 2 is prime;

%e a(2) = 3 because 1 + 1^3 + 2^3 = 10 is not prime, but 1 + 1^3 + 3^3 = 29 is prime;

%e a(3) = 8 because 1 + 1^3 + 3^3 + 4^3 = 93, 1 + 1^3 + 3^3 + 5^3 = 154, 1 + 1^3 + 3^3 + 6^3 = 245, and 1 + 1^3 + 3^3 + 7^3 = 372 are all nonprime, but 1 + 1^3 + 3^3 + 8^3 = 541 is prime.

%t p=1;lst={p};Do[If[PrimeQ[p+n^3],AppendTo[lst,n];p=p+n^3],{n,1,1500}];lst

%Y Cf. A219634.

%K nonn

%O 1,2

%A _Michel Lagneau_, Nov 24 2012

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.

Last modified June 15 15:25 EDT 2024. Contains 373407 sequences. (Running on oeis4.)