|
%I #16 Feb 10 2019 01:10:11
%S 1,4,9,49,169,289,1849,3969,6889,27889,69696,97969,499849,698896,
%T 2778889,4999696,9696996,19998784,46689889,66699889,79869969,
%U 277788889,478996996,876988996,1749999889,5599977889,7998976969,8998988769,17999978896
%N Squares with strictly increasing sum of digits.
%H Giovanni Resta, <a href="/A068809/b068809.txt">Table of n, a(n) for n = 1..80</a> (first 57 terms from Kevin Buzzard)
%p A007953 := proc(n) option remember: return add(d, d=convert(n, base, 10)): end: A068947 := proc(n) option remember: local k, p: if(n=1)then return 1: fi: k:=procname(n-1): p:=A007953(k^2): do k:=k+1: if(A007953(k^2)>p)then return k: fi: od: end: seq(A068947(n)^2, n=1..20); # _Nathaniel Johnston_, May 04 2011
%t t = {}; s = 0; Do[If[(x = Total[IntegerDigits[y = n^2]]) > s, AppendTo[t, y]; s = x], {n, 150000}]; t (* _Jayanta Basu_, Aug 06 2013 *)
%Y Cf. A068947, A068948, A068949, A068950, A068952, A069324.
%K base,nonn
%O 1,2
%A _Amarnath Murthy_, Mar 06 2002
%E More terms from Francois Jooste (phukraut(AT)hotmail.com), Mar 15 2002
|
