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 A067178 #6 Jun 27 2018 09:32:05 %S A067178 1,4,16,9,64,49,169,576,289,1849,4489,3969,17956,6889,27889,69696, %T A067178 98596,97969,499849,1887876,698896,2778889,4999696,9696996,19998784, %U A067178 46689889,66699889,79869969,277788889,478996996,876988996,3679999569,1749999889 %N A067178 Smallest square whose sum of digits is A056991(n). %C A067178 The smallest square giving a possible digit sum. %H A067178 Giovanni Resta, <a href="/A067178/b067178.txt">Table of n, a(n) for n = 1..94</a> %H A067178 Amarnath Murthy, <a href="http://www.gallup.unm.edu/~smarandache/MurthyBook.pdf">Fabricating perfect squares with a given valid digits sum</a>, page 154 in "Generalized partitions and New Ideas on Number Theory and Smarandache Sequences" by A. Murthy and C. Ashbacher %Y A067178 Cf. A056991, A067179. %K A067178 nonn,base %O A067178 1,2 %A A067178 _Amarnath Murthy_, Jan 09 2002 %E A067178 Corrected and extended by Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 24 2003 %E A067178 Offset corrected. - _R. J. Mathar_, Aug 26 2009