login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A347537 a(n) is the smallest prime p such that the polynomial k^4 + k^3 + k^2 + k + p yields primes for k = 0..n-1, but not for k = n. 0
2, 3, 13, 37, 109, 7, 1093, 457, 43, 430879, 130901527, 1838420599, 48181700197 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
At k=0, k^4 + k^3 + k^2 + k + p is, of course, prime for every prime p.
a(1)=2 because 2 is the smallest prime p such that 1^4 + 1^3 + 1^2 + 1 + p = 4 + p is not prime: 4 + 2 = 6 = 2*3.
a(2)=3 because 3 is the smallest prime p such that k^4 + k^3 + k^2 + k + p is prime for k=1 but not for k=2, i.e., such that 4 + p is prime but 2^4 + 2^3 + 2^2 + 2 + p = 30 + p is not prime: 4 + 3 = 7 is prime but 30 + 3 = 33 = 3*11.
a(6)=7 because 7 is the smallest prime p such that k^4 + k^3 + k^2 + k + p is prime for k = 1..5, but not for k = 6: 4 + 7 = 11, 30 + 7 = 37, 120 + 7 = 127, 340 + 7 = 347, and 780 + 7 = 787, but 1554 + 7 = 1561 = 7*223.
CROSSREFS
Sequence in context: A082539 A168483 A100424 * A289549 A259261 A141511
KEYWORD
nonn,more
AUTHOR
Jon E. Schoenfield, Sep 11 2021
EXTENSIONS
a(13) from Jinyuan Wang, Sep 11 2021
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)