OFFSET
1,2
COMMENTS
Contains 10^(2k) for all k.
More generally, if k is in this sequence so is 100k. - Charles R Greathouse IV, Sep 20 2012
REFERENCES
A. Murthy, Smarandache Pythagoras additive square sequence (to be published in Smarandache Notions Journal).
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
676 = 26^2, 6^2 + 7^2 + 6^2 = 121 = 11^2;
1444 = 38^2, 1^2 + 4^2 + 4^2 + 4^2 = 49 = 7^2.
MAPLE
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:
PROG
(PARI) ssd(n)=n=digits(n); sum(i=1, #n, n[i]^2)
v=List(); for(n=1, 1e4, if(issquare(ssd(n^2)), listput(v, n^2))); Vec(v) \\ Charles R Greathouse IV, Sep 20 2012
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Amarnath Murthy, Apr 19 2001
EXTENSIONS
Corrected and extended by James A. Sellers, Apr 20 2001
STATUS
approved