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.

A216869 The smallest non-constant arithmetic progression of integer squares of maximal length three.

Original entry on oeis.org

1, 25, 49
Offset: 1

Views

Author

Jonathan Sondow, Nov 20 2012

Keywords

Comments

Bremner (2012): "Euler showed that the length of the longest arithmetic progression (AP) of integer squares is equal to three. [See Dickson.] Xarles (2011) investigated APs in number fields, and proved the existence of an upper bound K(d) for the maximal length of an AP of squares in a number field of degree d. He shows that K(2) = 5." See A216870.

Examples

			a(1) = 1^2, a(2) = 5^2, a(3) = 7^2.
		

References

  • L. E. Dickson, History of the Theory of Numbers, Vol. II, Chelsea, New York, 1952, pp. 435-440.

Crossrefs

Formula

a(2) - a(1) = a(3) - a(2) = 24.