|
|
A113752
|
|
Smallest number m such that m, m+1 and m+2 have exactly n prime factors (counted with multiplicity).
|
|
5
|
|
|
33, 170, 1274, 15470, 33614, 3145310, 40909374, 668363967, 9864741248, 179199427328, 967461818750, 57938945781248
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(6) = 33614 = 2*7*7*7*7*7, a(6)+1 = 3*3*3*3*5*83, a(6)+2 = 2*2*2*2*11*191
|
|
MATHEMATICA
|
t = {}; n = 2; m = 1; While[Length[t] < 5, m++; If[n == PrimeOmega[m] == PrimeOmega[m + 1] == PrimeOmega[m + 2], AppendTo[t, m]; n++]]; t (* T. D. Noe, Aug 19 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|