%I A061912
%S A061912 0,1,2,3,13,67,264,1667,16667,94863,1643167,29983327,706399164
%N A061912 a(n) is the smallest m for which sqrt(sum of digits of m^2) = n.
%e A061912 Sum of digits of 13^2 = sum of digits of 169 = 16 is the first occurrence 
               of 4^2, so a(4) = 13.
%p A061912 f := []: a := 1: for i from 1 to 10 do for j from 1 do if sqrt(convert(convert(j^2,
               base,10),`+`)) = i then f := [op(f),j]; a := j; break fi; od; od; 
               f;
%Y A061912 Cf. A007953, A004159, A061909, A061910, A061911, A067072.
%Y A061912 Sequence in context: A100102 A164582 A068945 this_sequence A013167 A068096 
               A125283
%Y A061912 Adjacent sequences: A061909 A061910 A061911 this_sequence A061913 A061914 
               A061915
%K A061912 nonn,base
%O A061912 0,3
%A A061912 Asher Auel (asher.auel(AT)reed.edu), May 17 2001
%E A061912 One more term from John W. Layman (layman(AT)math.vt.edu), Jan 10 2002
%E A061912 One more term from Ryan Propper (rpropper(AT)stanford.edu), Jul 07 2005