OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
f:= proc(d) local b, i, t;
b:= (10^d-1)/9;
op(sort([seq(b+5*10^i, i=0..d-1), seq(b+10^t[1]+2*10^t[2], t = combinat:-permute([$0..d-1], 2))]))
end proc:
seq(f(i), i=1..5); # Robert Israel, Jan 13 2021
MATHEMATICA
Select[Range[20000], Times @@ IntegerDigits[#] == 6 &] (* T. D. Noe, Nov 16 2011 *)
PROG
(Python)
from sympy import prod
from sympy.utilities.iterables import multiset_permutations
def agen(maxdigits):
for digs in range(1, maxdigits+1):
for mp in multiset_permutations("1"*(digs-1) + "236", digs):
if prod(map(int, mp)) == 6: yield int("".join(mp))
print(list(agen(5))) # Michael S. Branicky, Jun 16 2021
CROSSREFS
KEYWORD
AUTHOR
Jaroslav Krizek, Nov 13 2011
STATUS
approved