login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180126 a(n) is the least k such that for numbers x >= k, PrimePi(n,x) > PrimePi(n-1,x), where PrimePi(n,x) is the number of n-almost-primes <= x. 1
3, 34, 15530, 151165607042 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Note that a(n) is an n-almost-prime. An n-almost-prime is a number having exactly n prime factors (counted with multiplicity). So 1 is the only 0-almost-prime; 1-almost-primes are the usual prime numbers; 2-almost-primes are also called semiprimes. The first three terms are mentioned in A125149.
For 2 <= n <= 4, the values for a(n)/a(n-1) (11.3, 456.8, 9733780.2) are each a little larger than A281889(n), "the median n-th least prime factor of the integers". - Peter Munn, Jan 04 2023
LINKS
CROSSREFS
Sequence in context: A194892 A182382 A222787 * A214854 A054287 A176761
KEYWORD
bref,hard,more,nonn
AUTHOR
T. D. Noe, Aug 11 2010
EXTENSIONS
Name edited by Peter Munn, Jan 04 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 15:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)