OFFSET
1,1
COMMENTS
Unlike the sequence for descending prime coefficients, this sequence allows n to be even also.
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
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Dec 11 2002
STATUS
approved