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.

A274591 Least number k such that k-1, k, k+1 are the sum of two nonzero squares in exactly n ways.

This page as a plain text file.
%I A274591 #19 Jun 05 2018 03:15:40
%S A274591 73,22049,90707201,4359889
%N A274591 Least number k such that k-1, k, k+1 are the sum of two nonzero squares in exactly n ways.
%C A274591 Corresponding triples are (72, 73, 74), (22048, 22049, 22050), (90707200, 90707201, 90707202), (4359888, 4359889, 4359890) for first four terms.
%C A274591 a(6) = 1428907401, a(8) = 2305281745. No more terms < 2*10^11. - _Lars Blomberg_, Jun 01 2018
%C A274591 a(5) > 10^15, if it exists. - _Giovanni Resta_, Jun 05 2018
%e A274591 a(2) = 22049 because 22048 = 12^2 + 148^2 = 68^2 + 132^2, 22049 = 32^2 + 145^2 = 40^2 + 143^2, 22050 = 21^2 + 147^2 = 105^2 + 105^2.
%Y A274591 Cf. A064716, A274548.
%K A274591 nonn,hard,more
%O A274591 1,1
%A A274591 _Altug Alkan_, Jun 29 2016