|
%I #10 Dec 15 2017 17:35:52
%S 169,529,841,1681,24649,96721,756900,833569,1478656,1666681,2972176,
%T 3258025,3617604,5405625,7166329,8162449,9721924,9771876,12404484,
%U 13184161,13380964,13778944,15776784,17464041,19079424,20034576
%N Define sds(n) = sum of the squares of the digits of n. Sequence gives smaller of two consecutive squares with sds(k^2) = sds((k+1)^2).
%C Is the sequence finite?
%H Harvey P. Dale, <a href="/A069645/b069645.txt">Table of n, a(n) for n = 0..10000</a>
%e sds(529) = 5^2 + 2^2 + 9^2 = 110 = sds(576) = 25 + 49 + 36.
%t Flatten[Position[Partition[Total[IntegerDigits[#]^2]&/@(Range[ 5000]^2),2,1], _?(First[#]==Last[#]&),{1},Heads->False]]^2 (* _Harvey P. Dale_, Jul 10 2014 *)
%K nonn,base
%O 0,1
%A _Amarnath Murthy_, Apr 04 2002
%E More terms from _Jason Earls_, May 10 2002
|
