The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A078625 Primenomial primes: primes generated by polynomials of degree n with sequentially increasing prime coefficients. This is for n = 3 or 2x^3 + 3x^2 + 5x + 7. 0
 17, 103, 577, 1753, 2357, 4973, 7507, 56857, 62627, 97387, 273367, 342107, 588397, 895667, 967753, 1005203, 1250357, 1635133, 1688153, 2554963, 3002653, 3328433, 3587657, 4976107, 5087087, 6550043, 6818257, 7234153, 10627753, 13827257 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Unlike the sequence for descending prime coefficients, this sequence allows n to be even also. LINKS FORMULA Seq(m, n) = prime(1)x^n + prime(2)x^(n-1) + ... prime(n+1) for x=1..m. n is the degree of the polynomial, m is the range and prime(i) is the i-th prime number. If Seq(m, n) is prime, list it. EXAMPLE Seq(100,2) = 19 157 439 1039 1229 1657 3659 5569 6907 7879 8389 10589 14369 17209 17959 19507 PROG (PARI) prnomial2(n, m) = { ct=0; sr=0; p=0; d=0; d1=0; for(x=1, n, y=prime(m+1); for(j=1, m, p = prime(j); y+=x^(m+1-j)*p; ); if(isprime(y), ct+=1; print1(y" "); ); ) } CROSSREFS Cf. A003627, A007528. Sequence in context: A229425 A041552 A160767 * A254757 A142266 A214632 Adjacent sequences:  A078622 A078623 A078624 * A078626 A078627 A078628 KEYWORD easy,nonn AUTHOR Cino Hilliard, Dec 11 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 1 04:06 EDT 2020. Contains 337441 sequences. (Running on oeis4.)