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 A110278 #17 Dec 28 2018 02:48:32
%S A110278 1,4,5,16,37,256,65536,80656,3459600,166926400
%N A110278 Values of n such that the perfect deficiency (A109883) of n and n+1 are both squares.
%C A110278 Conjecture: sequence is infinite.
%C A110278 No more terms below 10^9. - _Amiram Eldar_, Dec 27 2018
%e A110278 A109883(37)=36 & A109883(38)=16, both of which are squares, so 37 is a term.
%t A110278 subtract = If[ #1 < #2, Throw[ #1], #1 - #2]&; f[n_] := Catch @ Fold[subtract, n, Divisors @ n]; a = False; Do[b = IntegerQ[ Sqrt[ f[ n]]]; If[{a, b} == {True, True}, Print[n - 1]]; a = b, {n, 10^7}] (* _Robert G. Wilson v_, Jul 21 2005 *)
%o A110278 (PARI) a109883(n) = {my(r = n); fordiv(n, d, if (r < d, return (r)); r -= d;); 0;}
%o A110278 isok(n) = issquare(a109883(n)) && issquare(a109883(n+1)); \\ _Michel Marcus_, Dec 28 2018
%Y A110278 Cf. A110277.
%K A110278 more,nonn
%O A110278 1,2
%A A110278 _Jason Earls_, Jul 18 2005
%E A110278 a(10) from _Amiram Eldar_, Dec 27 2018