A357056 Integers k such that k^k + k^2 + 2*k + 1 is prime.
0, 1, 2, 3, 4, 9, 10, 13, 15, 24
Offset: 1
Examples
If k = 2, then k^k + k^2 + k*2 + 1 = 2^2 + 2^2 + 2*2 + 1 = 13, which is prime.
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.
If k = 2, then k^k + k^2 + k*2 + 1 = 2^2 + 2^2 + 2*2 + 1 = 13, which is prime.
Comments