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 A066564 #35 Dec 04 2024 17:51:16 %S A066564 0,2,8,17,27,38,72,86,135,161,179,216,245,275,315,347,432,467,521,558, %T A066564 614,662,720,770,830,882,944,998,1016,1080,1145,1220,1278,1355,1433, %U A066564 1512,1583,1664,1746,1829,1922,1998,2016,2111,2189,2286,2384,2483,2583 %N A066564 Numbers that when incremented by the sum of their digits produce a square. %H A066564 Indranil Ghosh, <a href="/A066564/b066564.txt">Table of n, a(n) for n = 1..11130</a> (terms 1..1000 from Harry J. Smith) %e A066564 179 is in the sequence because 179 + sum of digits of 179 = 179 + 17 = 196 which is a perfect square. - _Indranil Ghosh_, Feb 10 2017 %t A066564 Select[Range[0,2600],IntegerQ[Sqrt[#+Total[IntegerDigits[#]]]]&] (* _Harvey P. Dale_, May 19 2012 *) %o A066564 (PARI) digitsum(n) = local(s, d); s = 0; while(n>0, d = divrem(n, 10); n = d[1]; s = s+d[2]); s %o A066564 a066564(m) = local(n); for(n = 0, m, if(issquare(n+digitsum(n)), print1(n, ", "))) %o A066564 a066564(10000) %o A066564 (PARI) isok(n) = issquare(n + sumdigits(n)); \\ _Michel Marcus_, Jan 15 2016 %o A066564 (Magma) [n: n in [0..3*10^3] | IsSquare(&+Intseq(n)+n)]; // _Vincenzo Librandi_, Jan 15 2016 %Y A066564 Cf. A062028, A066566. %K A066564 base,nonn %O A066564 1,2 %A A066564 _Amarnath Murthy_, Dec 18 2001 %E A066564 More terms from _Jason Earls_, Dec 20 2001