OFFSET
1,2
COMMENTS
From M. F. Hasler, Nov 20 2019: (Start)
Like the other single-digit terms, zero would satisfy the definition (n = Sum_{i=1..k} d[i]^k when d[1..k] are the base 9 digits of n), but here only positive numbers are considered.
Terms a(n+1) = a(n) + 1 (n = 11, 13, 20, 23, 25, 29, 33, 48, 51, 57) correspond to solutions a(n) that are multiples of 9, in which case a(n) + 1 is also a solution. (End)
LINKS
Joseph Myers, Table of n, a(n) for n = 1..58 (the full list of terms, from Winter)
René-Louis Clerc, Perfect r-narcissistic numbers in any base, hal-04376934, 2024.
Eric Weisstein's World of Mathematics, Narcissistic Number
D. T. Winter, Table of Armstrong Numbers
EXAMPLE
126 = 150_9 (= 1*9^2 + 5*9^1 + 0*9^0) = 1^3 + 5^3 + 0^3. It is easy to see that 126 + 1 then also satisfies this relation, as for all other terms that are multiples of 9. - M. F. Hasler, Nov 20 2019
MATHEMATICA
Select[Range[9^7], # == Total[IntegerDigits[#, 9]^IntegerLength[#, 9]] &] (* Michael De Vlieger, Jan 17 2024 *)
PROG
(PARI) select( {is_A010353(n)=n==vecsum([d^#n|d<-n=digits(n, 9)])}, [0..10^4]) \\ This gives only terms < 10^6, for illustration of is_A010353(). - M. F. Hasler, Nov 20 2019
CROSSREFS
KEYWORD
base,fini,full,nonn
AUTHOR
EXTENSIONS
Edited by Joseph Myers, Jun 28 2009
STATUS
approved