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 A144407 #16 Feb 15 2020 14:31:28
%S A144407 49,289,529,961,1681,2209,2401,5041,5329,6241,7921,9409,10609,12769,
%T A144407 14161,16129,18769,22801,25921,27889,36481,37249,39601,47089,49729,
%U A144407 54289,57121,58081,66049,69169,73441,78961,82369,83521,96721,97969
%N A144407 A058529(n+1)^2.
%C A144407 The last digit is either 1 or 9 .
%H A144407 Ray Chandler, <a href="/A144407/b144407.txt">Table of n, a(n) for n = 1..10000</a>
%H A144407 M. de Frenicle, <a href="http://gallica.bnf.fr/ark:/12148/bpt6k5493994j/">Methode pour trouver la solutions des problemes par les exclusions</a>, in: Divers ouvrages des mathematiques et de physique par messieurs de l'academie royale des sciences, (1693) pp 1-44.
%t A144407 Select[Range[500], Union[Abs[Mod[FactorInteger[#][[All, 1]], 8, -1]]] == {1} &]^2 // Rest (* _Jean-François Alcover_, Sep 21 2015, after _T. D. Noe_ *)
%Y A144407 Cf. A058529, A198437.
%K A144407 nonn
%O A144407 1,1
%A A144407 _Paul Curtz_, Sep 30 2008