cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A049409 Numbers n such that n^4 + n^3 + n^2 + n + 1 is prime.

Original entry on oeis.org

1, 2, 7, 12, 13, 17, 22, 23, 24, 28, 29, 30, 40, 43, 44, 50, 62, 63, 68, 73, 74, 77, 79, 83, 85, 94, 99, 110, 117, 118, 120, 122, 127, 129, 134, 143, 145, 154, 162, 164, 165, 172, 175, 177, 193, 198, 204, 208, 222, 227, 239, 249, 254, 255, 260
Offset: 1

Views

Author

Keywords

Comments

There is no square > 1 in this sequence, because if f(n) = n^4 + n^3 + n^2 + n + 1, then f(n^2) = f(n)*f(-n). Actually, f(x) divides f(x^m) for all m not in 5Z. So the only perfect powers in this sequence can be 5th, 25th, 125th... powers. The least perfect power > 1 in this sequence is 22^5. - M. F. Hasler, Feb 09 2012
The corresponding prime numbers n^4 + n^3 + n^2 + n + 1 are in A088548. - Bernard Schott, Dec 19 2012
This is also the list of bases where 11111 is a prime number. - Christian N. K. Anderson, Mar 28 2013

Crossrefs

Cf. A088548.

Programs