login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060250 The smallest k! + 1 with exactly n prime factors (with multiplicity). 1
1, 4, 9, 23, 16, 18, 40, 89 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..8.

MATHEMATICA

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

PROG

(PARI) a(n)=my(k); while(bigomega(k++!+1)-n, ); k \\ Charles R Greathouse IV, Apr 25 2012

CROSSREFS

Cf. A054990.

Sequence in context: A231338 A257272 A070713 * A138991 A138990 A014543

Adjacent sequences:  A060247 A060248 A060249 * A060251 A060252 A060253

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Mar 23 2001

EXTENSIONS

a(8) from Arkadiusz Wesolowski, Apr 25 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 22:42 EST 2019. Contains 329987 sequences. (Running on oeis4.)