proposed
approved
proposed
approved
editing
proposed
(Python)
from itertools import islice, combinations_with_replacement
def A010354_gen(): # generator of terms
for k in range(1, 30):
a = tuple(i**k for i in range(8))
yield from (x[0] for x in sorted(filter(lambda x:x[0] > 0 and tuple(int(d, 8) for d in sorted(oct(x[0])[2:])) == x[1], \
((sum(map(lambda y:a[y], b)), b) for b in combinations_with_replacement(range(8), k)))))
A010354_list = list(islice(A010354_gen(), 20)) # Chai Wah Wu, Apr 20 2022
approved
editing
proposed
approved
editing
proposed
D. T. Winter, <a href="http://ftp.cwi.nl/dik/Armstrong">Table of Armstrong Numbers</a>
D. T. Winter, <a href="http://ftp.cwi.nl/dik/Armstrong">Table of Armstrong Numbers</a>
proposed
editing
editing
proposed
Base -8 Armstrong or narcissistic numbers (written in base 10).
Joseph Myers, <a href="/A010354/b010354.txt">Table of n, a(n) for n = 1..62</a> (the full list of terms, from Winter)
20 = 24[_8] (in base 8), and 2^2 + 4^2 = 20.
432 = 660[_8], , and 6^3 + 6^3 + 0^3 = 432; it's easy to see that 432 + 1 then also satisfies the equation, as for any term that is a multiple of 8. (End)
approved
editing
proposed
approved
editing
proposed