|
|
A061912
|
|
a(n) is the smallest m for which sqrt(sum of digits of m^2) = n.
|
|
8
|
|
|
0, 1, 2, 3, 13, 67, 264, 1667, 16667, 94863, 1643167, 29983327, 706399164, 31144643167, 1296109172867
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Sum of digits of 13^2 = sum of digits of 169 = 16 is the first occurrence of 4^2, so a(4) = 13.
|
|
MAPLE
|
f := []: a := 1: for i from 1 to 10 do for j from 1 do if sqrt(convert(convert(j^2, base, 10), `+`)) = i then f := [op(f), j]; a := j; break fi; od; od; f;
|
|
MATHEMATICA
|
t={}; m=0; Do[While[Sqrt[Total[IntegerDigits[m^2]]] != n, m++]; AppendTo[t, m], {n, 0, 9}]; t (* Jayanta Basu, May 06 2013 *)
|
|
PROG
|
(PARI) a(n) = my(k=0); while(sumdigits(k^2) != n^2, k++); k; \\ Michel Marcus, Jan 07 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
Asher Auel (asher.auel(AT)reed.edu), May 17 2001
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|