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”).

A199166
Smallest number with all identical digits having n prime factors with multiplicity.
0
2, 4, 8, 88, 888, 222222, 444444, 888888, 444444444444, 888888888888, 444444444444444444, 888888888888888888, 888888888888888888888888, 222222222222222222222222222222, 444444444444444444444444444444, 888888888888888888888888888888
OFFSET
1,1
FORMULA
min{ A010785(k): A001222(A010785(k)) = n}. - R. J. Mathar, Nov 03 2011
EXAMPLE
a(7) = 444444 = 2^2*3*7*11*13*37 has 7 prime factors with multiplicity, hence 444444 is in the sequence.
MAPLE
with(numtheory):for n from 1 to 17 do:i:=0:for k from 1 to 60 while(i=0)do:for a from 1 to 9 while(i=0)do:x:=((10^k- 1)/9)*a:if bigomega(x)=n then i:=1:printf(`%d, `, x):else fi:od:od:od:
MATHEMATICA
Table[digs = 1; While[i = 1; While[num = FromDigits[Table[i, {digs}]]; stop = (i > 9) || PrimeOmega[num] == n; ! stop, i++]; i > 9, digs++]; num, {n, 16}] (* T. D. Noe, Nov 03 2011 *)
CROSSREFS
Cf. A087331.
Sequence in context: A309565 A046385 A068664 * A018605 A058262 A018640
KEYWORD
nonn,base
AUTHOR
Michel Lagneau, Nov 03 2011
STATUS
approved