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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A174593 a(n) = is the smallest number such that the difference between a(n) and the sum of the square of his digits is n, or 0 if no such number exists. 2
1, 35, 0, 13, 24, 55, 0, 12, 0, 10, 23, 0, 44, 54, 22, 33, 20, 0, 43, 32, 0, 30, 42, 52, 40, 50, 0, 109, 0, 0, 0, 0, 0, 0, 0, 0, 119, 0, 0, 0, 0, 0, 0, 108, 0, 0, 0, 0, 139, 0, 0, 149, 118, 0, 0, 0, 0, 107, 0, 128, 0, 0, 0, 0, 138, 0, 117, 148, 158, 106, 0, 0, 0, 127, 0, 0, 0, 0, 116, 105 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Example : a(1) = 35 because 35 - (3^2 + 5^2) = 1.

LINKS

Zak Seidov, Table of n, a(n) for n = 0..1000

CROSSREFS

Cf. A003132, A174594.

Sequence in context: A236237 A067156 A291452 * A104785 A225313 A028847

Adjacent sequences:  A174590 A174591 A174592 * A174594 A174595 A174596

KEYWORD

base,nonn

AUTHOR

Claudio Meller, Mar 23 2010

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 09:05 EST 2017. Contains 294867 sequences.