login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest positive number formed by a set of digits whose product = sum of the digits.
10

%I #24 Feb 27 2023 17:03:44

%S 1,2,3,4,5,6,7,8,9,22,123,1124,11125,11133,11222,111126,1111127,

%T 1111134,11111128,11111223,111111129,111111135,1111111144,11111111136,

%U 11111111224,111111112222,1111111111137,1111111111145,1111111111233

%N Smallest positive number formed by a set of digits whose product = sum of the digits.

%C From _M. F. Hasler_, Oct 29 2014: (Start)

%C This is the subsequence of terms of A034710 with digits in nondecreasing order, which is meant by "smallest": For example, 132 also has sum of digits = product of digits, but is already "represented" by 123. The word "set" in the definition actually means "multiset".

%C The sequence is infinite: for any number N whose digits form a nondecreasing sequence whose sum of digits S is not larger than the product of digits P (i.e., N in A062998), a term of the sequence is obtained by prefixing N with P-S digits '1'. (End)

%H Chai Wah Wu, <a href="/A061672/b061672.txt">Table of n, a(n) for n = 1..667</a> (terms n=1..134 from T. D. Noe).

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a061/A061672.java">Java program</a> (github)

%e 1124 is a term since 1 + 1 + 2 + 4 = 1*1*2*4 = 8.

%o (PARI) is_A061672(n)={vecsort(n=digits(n))==n && normlp(n,1)==prod(i=1,#n,n[i])} \\ _M. F. Hasler_, Oct 29 2014

%Y Cf. A034710, A249334.

%K nonn,base,easy

%O 1,2

%A _Amarnath Murthy_, Jun 26 2001

%E Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jun 27 2001

%E Corrected by _Franklin T. Adams-Watters_, Oct 25 2006

%E Further corrections from _T. D. Noe_, Oct 12 2007