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.

A099806 If a,b are prime numbers satisfying the Diophantine equation a^3+b^3=c^2, then a is -1 mod 12 and b is 1 mod 12, or vice versa. Choose 'a' to be -1 mod 12. This is the sequence of 'a' values, sorted by the magnitude of c.

Original entry on oeis.org

11, 8663, 28703, 56999, 44111, 86291, 87959, 16931, 246011, 54083, 367823, 552011, 457511, 571019, 765983, 1586531, 1915163, 2437751, 16139, 2305883, 4074743, 3963299, 1296563, 5440991, 4683779, 2238023, 9682703, 8681639, 8142803
Offset: 0

Views

Author

James R. Buddenhagen, Oct 26 2004

Keywords

Comments

All terms of this sequence are of the form 3*M^4-N^4+6*M^2*N^2 for some pair M,N of relatively prime positive integers of opposite parity.

Examples

			11 is in the sequence because 11 is -1 mod 12 and 11^3+37^3 = 228^2.
		

Crossrefs