The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A174594 a(n) = is the smallest number such that the difference between the sum of the square of his digits and a(n) is n, or 0 if no such number exists. 1
 1, 0, 2, 14, 25, 56, 3, 0, 0, 36, 0, 15, 4, 0, 26, 0, 0, 57, 47, 0, 5, 16, 0, 0, 0, 0, 27, 0, 0, 0, 6, 58, 48, 17, 0, 38, 0, 0, 0, 0, 28, 0, 7, 0, 0, 0, 0, 18, 49, 0, 0, 39, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Example : a(3) = 14, because 1^2 + 4^2 - 14 = 3. LINKS CROSSREFS Cf. A003132, A174593. Sequence in context: A226334 A109255 A285990 * A051222 A194411 A017545 Adjacent sequences:  A174591 A174592 A174593 * A174595 A174596 A174597 KEYWORD base,nonn AUTHOR Claudio Meller, Mar 23 2010 EXTENSIONS a(0)=1 prepended by Michel Marcus, Feb 05 2014 STATUS approved

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

Last modified April 11 13:59 EDT 2021. Contains 342886 sequences. (Running on oeis4.)