[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Search: a181963 -id:a181963
     Sort: relevance | references | number | modified | created      Format: long | short | data
Least prime p such that p+3*k*(k+1) is prime for all k=0,...,n.
+10
1
2, 5, 5, 5, 11, 11, 11, 11, 11, 11, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23
OFFSET
0,1
COMMENTS
Inspired by the so-called prime-generating polynomials.
Since p | 3n(n+1) for n=p-1, one has a(n) > p(n). Otherwise stated, a(p-1) = p (as, e.g., for p=23) is optimal.
PROG
(PARI) a(n)=forprime(p=1, , for(i=1, n, ispseudoprime(p+3*(i+1)*i)||next(2)); return(p))
CROSSREFS
KEYWORD
nonn,more
AUTHOR
M. F. Hasler, Apr 05 2015
STATUS
approved

Search completed in 0.004 seconds