OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
For n=2, the smallest sum of 2*n+1 = 5 cubed consecutive primes which is prime is a(2) = 7^3 + 11^3 + 13^3 + 17^3 + 19^3 = 15643.
MAPLE
P3:= map(t -> t^3, select(isprime, [seq(i, i=3..10^5, 2)])):
SP3:= ListTools:-PartialSums(P3):
f:= proc(n) local k;
for k from 1 do if isprime(SP3[k+2*n+1]-SP3[k]) then return SP3[k+2*n+1]-SP3[k] fi od
end proc:
map(f, [$1..50]); # Robert Israel, Feb 02 2025
MATHEMATICA
a[n_] := Block[{k = 1, s}, While[s = Sum[Prime[i]^3, {i, k, k + 2n}]; !PrimeQ[s], k++ ]; s]; Table[a[n], {n, 1, 27}]
PROG
(PARI) a(n) = my(k=2, s = sum(i=0, 2*n, prime(k+i)^3)); while (!isprime(s), s -= prime(k)^3; k++; s += prime(k+2*n)^3; ); s; \\ Michel Marcus, Jan 20 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jan 02 2025
STATUS
approved