This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014576 Smallest n-digit narcissistic (or Armstrong) number: smallest n-digit number equal to sum of n-th powers of its digits (or 0 if no such number exists). 12

%I

%S 1,0,153,1634,54748,548834,1741725,24678050,146511208,4679307774,

%T 32164049650,0,0,28116440335967,0,4338281769391370,21897142587612075,

%U 0,1517841543307505039,63105425988599693916,128468643043731391252,0

%N Smallest n-digit narcissistic (or Armstrong) number: smallest n-digit number equal to sum of n-th powers of its digits (or 0 if no such number exists).

%D M. Gardner, The Magic Numbers of Dr Matrix. Prometheus, Buffalo, NY, 1985, p. 249.

%D C. A. Pickover, Keys to Infinity. New York: W. H. Freeman, pp. 169-170, 1995.

%H T. D. Noe, <a href="/A014576/b014576.txt">Table of n, a(n) for n=1..39</a> (complete sequence)

%H Harvey Heinz, <a href="http://www.magic-squares.net/narciss.htm">Narcissistic Numbers</a>

%H Mike Keith, <a href="http://web.archive.org/web-cdx/20080512020203/http://users.aol.com/s6sj7gt/mikewild.htm">Wild Narcissistic Numbers</a> (Copy as of May 2008 on web.archive.org - page does not exist any more.)

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/NarcissisticNumber.html">Narcissistic Number.</a>

%t (* This program is not suitable for more than 10 terms *) a[n_] := For[k = 10^(n-1), True, k++, If[k > 10^n - 1, Return, If[k == Total[ IntegerDigits[k]^IntegerLength[k] ], Return[k] ] ] ]; Table[ Print[an = a[n]]; an, {n, 1, 10}] (* _Jean-François Alcover_, Oct 15 2013 *)

%Y Cf. A001694, A007532, A005934, A005188, A003321, A023052, A046074.

%K nonn,base,fini,full,nice

%O 1,3

%A _N. J. A. Sloane_