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”).

A092792
First prime in n# + m.
0
2, 5, 7, 13, 11, 13, 19, 17, 19, 229, 23, 29, 31, 29, 31, 37, 37, 43, 41, 43, 73, 47, 53, 79, 53, 59, 61, 59, 61, 67, 67, 73, 71, 73, 79, 79, 109, 83, 89, 89, 2399, 97, 97, 103, 101, 103, 109, 107, 109, 139, 113, 2423, 149, 127, 127, 157, 131, 137, 139, 137, 139, 349
OFFSET
2,1
FORMULA
n# = n primorial or product of primes up to n
PROG
(PARI) npmorpm2(n) = { forstep(p=1, n, 2, for(x=1, n, y=primorial(x)+p; if(ispseudoprime(y), print1(y", "); break)) ) } primorial(n) = { p1=1; forprime(x=2, n, p1*=x); return(p1) }
CROSSREFS
Sequence in context: A041517 A041975 A042577 * A238336 A083271 A094285
KEYWORD
hard,nonn
AUTHOR
Cino Hilliard, Apr 15 2004
STATUS
approved