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 A061269 #18 Sep 24 2018 16:53:13
%S A061269 1,4,9,144,441,44944
%N A061269 Squares with nonzero digits such that (1) each digit is a square and (2) the sum of the digits is a square.
%C A061269 Note that (1) implies that the product of the digits is a square.
%C A061269 Next term, if it exists, is > 90000000000. - Larry Reeves (larryr(AT)acm.org), May 11 2001
%D A061269 Amarnath Murthy, The Smarandache multiplicative square sequence is infinite, (to be published in Smarandache Notions Journal).
%D A061269 Amarnath Murthy, Infinitely many common members of the Smarandache additive as well as multiplicative square sequence, (to be published in Smarandache Notions Journal).
%H A061269 Felice Russo, <a href="http://www.gallup.unm.edu/~smarandache/Felice-Russo-book1.pdf">A Set of New Smarandache Functions, Sequences and Conjectures in Number Theory</a>, Lupton, AZ: American Research Press, 2000.
%e A061269 For example, 44944 = 212^2, each digit is a square, sum of digits = 4+4+9+4+4 = 25 = 5^2.
%t A061269 For[n = 1, n < 100000, n++, a := DigitCount[n^2]; If[a[[2]] == 0, If[a[[3]] == 0, If[a[[5]] == 0, If[a[[6]] == 0, If[a[[7]] == 0, If[a[[8]] == 0, If[a[[10]] == 0, If[Sqrt[Sum[a[[i]]*i, {i, 1, 10}]] == Floor[Sqrt[Sum[a[[i]]*i, {i, 1, 10}]]], Print[n^2]]]]]]]]]] (* _Stefan Steinerberger_, Mar 15 2006 *)
%Y A061269 If zeros are allowed as digits, the result is A061270.
%Y A061269 A subsequence of A006716.
%Y A061269 Cf. A053057, A053059, A061267, A061268, A061269, A061270.
%K A061269 nonn,base
%O A061269 1,2
%A A061269 _Amarnath Murthy_, Apr 24 2001
%E A061269 Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jun 05 2007