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.

A263722 Integers k > 0 such that k^2 + p^2 is composite for all primes p.

Original entry on oeis.org

9, 11, 19, 21, 23, 25, 29, 31, 39, 41, 43, 49, 51, 53, 55, 59, 61, 63, 69, 71, 75, 77, 79, 81, 83, 89, 91, 93, 99, 101, 105, 107, 109, 111, 113, 119, 121, 123, 127, 129, 131, 133, 139, 141, 143, 145, 149, 151, 153, 157, 159, 161, 165, 169, 171, 173, 175, 179, 181, 185, 187, 189, 191, 195, 197, 199
Offset: 1

Views

Author

Keywords

Comments

Conjecture: All terms are odd. An equivalent conjecture in A263977 is that if k > 0 is even, then k^2 + p^2 is prime for some prime p. We have checked this for all k <= 12*10^7.
An odd number k is a term if and only if k^2 + 2^2 is composite, since k^2 + p^2 is even and > 2 (hence composite) for all odd primes p. Thus if the Conjecture is true, then the sequence is simply odd k such that k^2 + 4 is composite. The sequence of odd k, such that k^2 + 4 is prime, is A007591.
The complementary sequence is A263977. Given k in it, the smallest prime p, such that k^2 + p^2 is prime, is in A263726. These numbers k^2 + p^2 form A185086, the Fouvry-Iwaniec primes.

Examples

			9^2 + 2^2 = 85 = 5*17, 11^2 + 2^2 = 125 = 5^3, and 23^2 + 2^2 = 533 = 13*41 are composite, so 9, 11, and 23 are members.
1^2 + 2^2 = 5 and 2^2 + 3^3 = 13 are prime, so 1, 2, and 3 are not members.
		

Crossrefs