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

 

Logo

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!)
A060250 The smallest k! + 1 with exactly n prime factors (with multiplicity). 1

%I

%S 1,4,9,23,16,18,40,89

%N The smallest k! + 1 with exactly n prime factors (with multiplicity).

%t With[{f=PrimeOmega[Range[90]!+1]},Table[Position[f,_?(#==n&),1,1],{n,8}]]//Flatten (* _Harvey P. Dale_, Feb 11 2018 *)

%o (PARI) a(n)=my(k);while(bigomega(k++!+1)-n,);k \\ _Charles R Greathouse IV_, Apr 25 2012

%Y Cf. A054990.

%K nonn

%O 1,2

%A _Robert G. Wilson v_, Mar 23 2001

%E a(8) from Arkadiusz Wesolowski, Apr 25 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 11:01 EST 2020. Contains 331083 sequences. (Running on oeis4.)