The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A115186 Smallest number m such that m and m+1 have exactly n prime factors (counted with multiplicity). 6
 2, 9, 27, 135, 944, 5264, 29888, 50624, 203391, 3290624, 6082047, 32535999, 326481920, 3274208000, 6929459199, 72523096064, 37694578688, 471672487935, 11557226700800, 54386217385983, 50624737509375, 275892612890624, 4870020829413375, 68091093855502335, 2280241934368767 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A001222(a(n)) = A001222(a(n)+1) = n: subsequence of A045920; a(16) > 4*10^10 - Martin Fuller, Jan 17 2006 a(n)  <= A093548(n) <= A052215(n). - Zak Seidov, Jan 16 2015 REFERENCES J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 135, p. 46, Ellipses, Paris 2008. LINKS EXAMPLE a(10) = 3290624 = 6427 * 2^9, 3290624+1 = 13 * 5^5 * 3^4: A001222(3290624) = A001222(3290625) = 10. CROSSREFS Cf. A001222, A045920, A052215, A093548. Sequence in context: A123904 A327612 A019065 * A243560 A090900 A155472 Adjacent sequences:  A115183 A115184 A115185 * A115187 A115188 A115189 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jan 16 2006 EXTENSIONS a(13)-a(15) from Martin Fuller, Jan 17 2006 a(16)-a(17) from Donovan Johnson, Apr 08 2008 a(18)-a(22) from Donovan Johnson, Jan 21 2009 a(23)-a(25) from Donovan Johnson, May 25 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 January 19 13:17 EST 2021. Contains 340270 sequences. (Running on oeis4.)