proposed
approved
proposed
approved
editing
proposed
if (s:=sum(d))>0 and sorted(str(a:=sum(d)s*n)) == [str(e) for e in d] and a>0:
proposed
editing
editing
proposed
(Python)
from itertools import count, islice, combinations_with_replacement
def A003635_gen(startvalue=1): # generator of terms >= startvalue
for n in count(max(startvalue, 1)):
for l in count(1):
if 9*l*n < 10**(l-1):
yield n
break
for d in combinations_with_replacement(range(10), l):
if sorted(str(a:=sum(d)*n)) == [str(e) for e in d] and a>0:
break
else:
continue
break
A003635_list = list(islice(A003635_gen(), 20)) # Chai Wah Wu, May 09 2023
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
David Radcliffe, <a href="http://gotmath.com/inconsummate.html">Inconsummate Numbers</a>
approved
editing
reviewed
approved