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

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

%I

%S 2,9,27,135,944,5264,29888,50624,203391,3290624,6082047,32535999,

%T 326481920,3274208000,6929459199,72523096064,37694578688,471672487935,

%U 11557226700800,54386217385983,50624737509375,275892612890624,4870020829413375,68091093855502335,2280241934368767

%N Smallest number m such that m and m+1 have exactly n prime factors (counted with multiplicity).

%C A001222(a(n)) = A001222(a(n)+1) = n: subsequence of A045920;

%C a(16) > 4*10^10 - _Martin Fuller_, Jan 17 2006

%C a(n) <= A093548(n) <= A052215(n). - _Zak Seidov_, Jan 16 2015

%D J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 135, p. 46, Ellipses, Paris 2008.

%e a(10) = 3290624 = 6427 * 2^9, 3290624+1 = 13 * 5^5 * 3^4:

%e A001222(3290624) = A001222(3290625) = 10.

%Y Cf. A001222, A045920, A052215, A093548.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Jan 16 2006

%E a(13)-a(15) from _Martin Fuller_, Jan 17 2006

%E a(16)-a(17) from _Donovan Johnson_, Apr 08 2008

%E a(18)-a(22) from _Donovan Johnson_, Jan 21 2009

%E a(23)-a(25) from _Donovan Johnson_, May 25 2013

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 June 13 20:25 EDT 2021. Contains 345009 sequences. (Running on oeis4.)