This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062685 Smallest square with digit sum n (or 0 if no such square exists). 2

%I

%S 1,0,0,4,0,0,16,0,9,64,0,0,49,0,0,169,0,576,289,0,0,1849,0,0,4489,0,

%T 3969,17956,0,0,6889,0,0,27889,0,69696,98596,0,0,97969,0,0,499849,0,

%U 1887876,698896,0,0,2778889,0,0,4999696,0,9696996,19998784,0,0

%N Smallest square with digit sum n (or 0 if no such square exists).

%C a(n) > 0 iff n mod 9 is 0, 1, 4, or 7. - _Jon E. Schoenfield_, Jul 06 2018

%H Jon E. Schoenfield, <a href="/A062685/b062685.txt">Table of n, a(n) for n = 1..228</a> (first 213 terms from Giovanni Resta)

%e 16 is the smallest square with digit sum 7, so a(7)=16.

%t Array[If[FreeQ[{1, 4, 7, 9}, FixedPoint[Total@ IntegerDigits@ # &, #]], 0, Block[{k = 1, s}, While[Total@ IntegerDigits@ Set[s, k^2] != #, k++]; s]] &, 57] (* _Michael De Vlieger_, Jul 06 2018 *)

%Y Cf. A004159, A056991.

%K base,nonn

%O 1,4

%A _Erich Friedman_, Jul 04 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 22:00 EDT 2018. Contains 316378 sequences. (Running on oeis4.)