cp's OEIS Frontend

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.

%I A219635 #9 Sep 14 2017 03:53:23
%S A219635 1,3,8,12,18,22,24,36,44,52,60,66,74,102,112,116,124,134,136,156,224,
%T A219635 234,246,304,312,320,340,374,390,396,402,426,450,460,522,528,554,568,
%U A219635 588,612,632,640,654,660,686,700,704,706,710,718,762,764,772,788,846
%N 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.
%C A219635 The corresponding primes are 2, 29, 541, 2269, 8101, 18749, 32573,...
%e A219635 a(1) = 1 because 1 + 1^3 = 2 is prime;
%e A219635 a(2) = 3 because 1 + 1^3 + 2^3 = 10 is not prime, but 1 + 1^3 + 3^3 = 29 is prime;
%e A219635 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 A219635 p=1;lst={p};Do[If[PrimeQ[p+n^3],AppendTo[lst,n];p=p+n^3],{n,1,1500}];lst
%Y A219635 Cf. A219634.
%K A219635 nonn
%O A219635 1,2
%A A219635 _Michel Lagneau_, Nov 24 2012