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.

A274567 Least number k such that k^2-1 is the sum of two nonzero squares in exactly n ways.

Original entry on oeis.org

3, 81, 51, 291, 1251, 339, 62499, 1971, 5201, 5001, 175781251, 7299
Offset: 1

Views

Author

Altug Alkan, Jun 28 2016

Keywords

Comments

a(11) > 25*10^5 if it exists. - Chai Wah Wu, Jul 23 2020
From David A. Corneth, Jul 23 2020: (Start)
a(13) <= 17578125001, a(17) <= 610351562499. (End)

Examples

			a(2) = 81 because 81^2 - 1 = 28^2 + 76^2 = 44^2 + 68^2.
		

Crossrefs

Extensions

a(10) from Chai Wah Wu, Jul 22 2020