This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113752 Smallest number m such that m, m+1 and m+2 have exactly n prime factors (counted with multiplicity). 0
 33, 170, 1274, 15470, 33614, 3145310, 40909374, 668363967, 9864741248, 179199427328, 967461818750, 57938945781248 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS n = A001222(a(n)) = A001222(a(n)+1) = A001222(a(n)+2). Subsequence of A045920. a(14) <= 1247579465781248. - Donovan Johnson, Jun 12 2013 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 Cf. A001222, A045920, A093549, A093550, A115186. Sequence in context: A256021 A172077 A180943 * A155883 A071914 A279867 Adjacent sequences:  A113749 A113750 A113751 * A113753 A113754 A113755 KEYWORD more,nonn,hard AUTHOR Martin Fuller, Jan 17 2006 EXTENSIONS a(9)-a(11) from Donovan Johnson, Apr 08 2008 a(12) from Donovan Johnson, Aug 08 2011 a(13) from Jud McCranie, Aug 19 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 23 03:26 EDT 2019. Contains 322380 sequences. (Running on oeis4.)