|
Search: id:A092792
|
|
| |
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
FORMULA
|
n# = n primorial or product of primes up to n
|
|
PROGRAM
|
(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 this_sequence A083271 A094285 A121218
Adjacent sequences: A092789 A092790 A092791 this_sequence A092793 A092794 A092795
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Apr 15 2004
|
|
|
Search completed in 0.002 seconds
|
