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!)
 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

%I

%S 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,

%T 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,

%U 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

%N 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.

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

%H Zak Seidov, <a href="/A174593/b174593.txt">Table of n, a(n) for n = 0..1000</a>

%Y Cf. A003132, A174594.

%K base,nonn

%O 0,2

%A _Claudio Meller_, Mar 23 2010

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 10 19:06 EDT 2021. Contains 342853 sequences. (Running on oeis4.)