|
%I #20 Jun 23 2021 09:59:16
%S 6,23,49,66,229,236,334,389,469,666,2233,2269,2349,2366,2899,3338,
%T 3346,3689,4499,4669,6666,22239,22336,22499,22669,23334,23389,23469,
%U 23666,26899,33368,33449,33466,34899,36689,44699,46669,66666,88999,222299,222333,222369,223349
%N Numbers without a digit 1 with digits in nondecreasing order and the product of digits is a power of 6.
%C Applying any of the following to terms in this sequence in any order gives a term from A276038: - Prepend a 1. - Permute digits. - Do nothing.
%C Subsequence of A276038.
%H Michael S. Branicky, <a href="/A304392/b304392.txt">Table of n, a(n) for n = 1..10656</a> (all terms with <= 23 digits)
%e 229 is in the sequence because it has digits in nondecreasing order, no digit 1 and a product of digits 2*2*9 = 36 which is a power of 6.
%t Select[Range[10^6], And[FreeQ[#, 1], AllTrue[Differences@ #, # > -1 &], IntegerQ@ Log[6, Times @@ #]] &@ IntegerDigits@ # &] (* _Michael De Vlieger_, Jun 30 2018 *)
%o (PARI) is(n) = my(d = digits(n), p = prod(i = 1, #d, d[i])); d[1] >= 2 && vecsort(d) == d && 6^logint(p, 6) == p
%o (Python)
%o from math import prod
%o from sympy.utilities.iterables import multiset_combinations
%o def auptod(maxdigs):
%o n, digs, alst, targets = 0, 1, [], set(6**i for i in range(1, maxdigs*3))
%o for digs in range(1, maxdigs+1):
%o mcstr = "".join(str(d)*digs for d in "234689")
%o for mc in multiset_combinations(mcstr, digs):
%o if prod(map(int, mc)) in targets: alst.append(int("".join(mc)))
%o return alst
%o print(auptod(6)) # _Michael S. Branicky_, Jun 23 2021
%Y Cf. A009994, A276038.
%K nonn,base
%O 1,1
%A _David A. Corneth_, Jun 20 2018
|
