login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061912 a(n) is the smallest m for which sqrt(sum of digits of m^2) = n. 3
0, 1, 2, 3, 13, 67, 264, 1667, 16667, 94863, 1643167, 29983327, 706399164, 31144643167 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

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;

CROSSREFS

Cf. A007953, A004159, A061909, A061910, A061911, A067072.

Sequence in context: A100102 A164582 A068945 * A013167 A068096 A125283

Adjacent sequences:  A061909 A061910 A061911 * A061913 A061914 A061915

KEYWORD

nonn,base

AUTHOR

Asher Auel (asher.auel(AT)reed.edu), May 17 2001

EXTENSIONS

One more term from John W. Layman (layman(AT)math.vt.edu), Jan 10 2002

One more term from Ryan Propper (rpropper(AT)stanford.edu), Jul 07 2005

a(13) from Zak Seidov (zakseidov(AT)yahoo.com), Jan 27 2011.

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

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:48 EST 2012. Contains 205978 sequences.