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.

A357945 Numbers k which are not square but D = (b+c)^2 - k is square, where b = floor(sqrt(k)) and c = k - b^2.

This page as a plain text file.
%I A357945 #111 Mar 21 2023 05:20:39
%S A357945 5,13,28,65,69,76,125,128,189,205,300,305,325,352,413,425,532,533,544,
%T A357945 565,693,725,793,828,860,1025,1036,1045,1105,1141,1248,1449,1469,1504,
%U A357945 1525,1708,1885,1917,1965,2125,2240,2353,2380,2501,2533,2548,2812,2816,2825,2829,2844,2873,2893
%N A357945 Numbers k which are not square but D = (b+c)^2 - k is square, where b = floor(sqrt(k)) and c = k - b^2.
%C A357945 All composite terms are included in A177713.
%C A357945 Terms are the difference of two perfect squares k = (b+c)^2 - d^2, where d = sqrt(D), and so if composite are factorizable by Fermat's method k = ((b+c) + d) * ((b+c) - d).
%F A357945 1.6*n < a(n) <= 4n^4 + 1. (Improvements welcome!) - _Charles R Greathouse IV_, Oct 23 2022
%e A357945 8525 is a term since it's not square and b = floor(sqrt(k)) = 92 and c = k - b^2 = 61 gives D = (b+c)^2 - k = 14884 which is square (122^2).
%o A357945 (Python)
%o A357945 from gmpy2 import *
%o A357945 def is_A357945(n):
%o A357945   if not is_square(n):
%o A357945     b,c = isqrt_rem(n)
%o A357945     return is_square(c*(2*b+c-1))
%o A357945   else:
%o A357945     return False
%o A357945 (PARI) isok(k) = if (!issquare(k), my(b=sqrtint(k), c=k-b^2); issquare((b+c)^2 - k)); \\ _Michel Marcus_, Oct 23 2022
%Y A357945 Subsequence of A042965 and of A000037.
%Y A357945 A211412 is a subsequence.
%Y A357945 Cf. A053186, A177713.
%K A357945 nonn
%O A357945 1,1
%A A357945 _DarĂ­o Clavijo_, Oct 21 2022