OFFSET
1,1
LINKS
Daniel Mondot, Table of n, a(n) for n = 1..15650
MAPLE
For Maple code see A058906.
PROG
(Python)
from itertools import count, islice, combinations_with_replacement
from sympy.ntheory import digits
def A058900_gen(startvalue=1): # generator of terms >= startvalue
for n in count(max(startvalue, 1)):
for l in count(1):
if 3*l*n < 1<<((l-1)<<1):
yield n
break
for d in combinations_with_replacement((0, 1, 2, 3), l):
if (s:=sum(d)) > 0 and sorted(digits(s*n, 4)[1:]) == list(d):
break
else:
continue
break
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Jan 09 2001
STATUS
approved