OFFSET
1,1
COMMENTS
Generalization of A197421.
LINKS
Michel Marcus, Table of n, a(n) for n = 1..100
EXAMPLE
For n=1, k=22 gives the smallest prime of the form Sum_{j=1..k} prime(j)*prime(j+1) = 44839 = 2*3 + 3*5 + 5*7 + ... + 79*83 where 79 = prime(22) and 83 = prime(23).
MAPLE
for n from 1 to 20 do:i:=0:p:=0:for j from 1 to 1000 while(i=0) do: uu:=1:for k from 0 to n do: uu:=uu*ithprime(j+k):od:p:=p+uu:if type(p, prime)=true then i:=1: printf(`%d, `, p):else fi:od:od:
PROG
(PARI) a(n) = my(k=1, p); while (!isprime(p=sum(j=1, k, prod(i=0, n, prime(j+i)))), k++); p; \\ Michel Marcus, Feb 21 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Oct 16 2011
STATUS
approved