Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Mar 30 2012 17:26:31
%S 10,13,18,22,27,31,36,40,45,54,63,72,79,81,88,90,97,100,101,104,109,
%T 131,136,181,188,222,227,272,279,310,313,318,363,400,401,404,409,454,
%U 540,545,631,636,722,727,790,797,810,813,818,881,888,900,901,904,909,972,979,1000,1001,1004,1009,1010,1013,1018,1040,1045,1090,1097,1310,1313,1318,1363,1810,1813,1818,1881,1888
%N Each pair of adjacent digits of n sums to a square.
%t s={};Do[id=IntegerDigits[n];If[Union[IntegerQ/@Sqrt[Rest[id]+Most[id]]]=={True},AppendTo[s,n]],{n,10,2000}];s
%Y Cf. A028839 Sum of digits of n is a square,
%Y Cf. A061910 (numbers n such that sum of digits of n^2 is a square).
%K nonn,base
%O 1,1
%A _Zak Seidov_, Nov 27 2010