|
%I #18 May 26 2019 01:48:39
%S 1,4,9,100,400,676,841,900,1444,4225,10000,24025,40000,42025,42436,
%T 43264,66049,67600,84100,90000,109561,119716,144400,155236,239121,
%U 244036,248004,252004,335241,355216,362404,373321,422500,643204,664225
%N Squares the sum of the squares of whose digits are squares.
%C Contains 10^(2k) for all k.
%C More generally, if k is in this sequence so is 100k. - _Charles R Greathouse IV_, Sep 20 2012
%D A. Murthy, Smarandache Pythagoras additive square sequence (to be published in Smarandache Notions Journal).
%H Charles R Greathouse IV, <a href="/A061090/b061090.txt">Table of n, a(n) for n = 1..10000</a>
%e 676 = 26^2, 6^2 + 7^2 + 6^2 = 121 = 11^2;
%e 1444 = 38^2, 1^2 + 4^2 + 4^2 + 4^2 = 49 = 7^2.
%p readlib(issqr): for n from 1 to 2000 do L1 := convert(n^2, base, 10): if issqr(sum(L1[i]^2, i=1..nops(L1))) then printf(`%d,`,n^2) fi: od:
%o (PARI) ssd(n)=n=digits(n);sum(i=1,#n,n[i]^2)
%o v=List();for(n=1,1e4,if(issquare(ssd(n^2)),listput(v,n^2))); Vec(v) \\ _Charles R Greathouse IV_, Sep 20 2012
%Y Cf. A053057.
%K nonn,base
%O 1,2
%A _Amarnath Murthy_, Apr 19 2001
%E Corrected and extended by _James A. Sellers_, Apr 20 2001
|
