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.
%I A374061 #23 Jun 27 2024 10:19:17 %S A374061 0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,1, %T A374061 0,0,0,0,0,0,1,0,0,0,0,1,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,1,1,0,0,0,0,1, %U A374061 0,0,1,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,1,0,1,0,0,1,1,0,0,0,0,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,2 %N A374061 Number of solutions to a^2 + n = 2 * b^2 with 0 < a < b. %H A374061 Seiichi Manyama, <a href="/A374061/b374061.txt">Table of n, a(n) for n = 1..10000</a> %e A374061 3^2 + 119 = 2 * 8^2 and 9^2 + 119 = 2 * 10^2. So a(119) = 2. %Y A374061 Cf. A331671. %K A374061 nonn,easy %O A374061 1,119 %A A374061 _Seiichi Manyama_, Jun 27 2024