OFFSET
1,1
COMMENTS
Original name: 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.
Unlike the sequence for descending prime coefficients, this sequence allows n to be even also.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
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.
MAPLE
f:= x-> (p-> `if`(isprime(p), p, [][]))(7+(5+(3+2*x)*x)*x):
map(f, [$0..250])[]; # Alois P. Heinz, Jul 07 2025
PROG
(PARI) prnomial2(n, m) = { ct=0; sr=0; p=0; d=0; d1=0; for(x=0, 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
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Dec 11 2002
EXTENSIONS
a(1)=7 inserted by Sean A. Irvine, Jul 07 2025
STATUS
approved
