The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A116435 Number of n-almost primes less than or equal to n^n. 1
0, 1, 5, 34, 269, 2613, 28893, 359110, 4934952, 74342563, 1217389949, 21533211312, 409230368646, 8318041706593 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Consider the array T(r,c) where is the number of c-almost primes less than or equal to r^c. This is the diagonal T(r,r).
LINKS
EXAMPLE
a(3)=5 because there are five 3-almost primes <= 27, 8,12,18,20&27.
MATHEMATICA
AlmostPrimePi[k_Integer, n_] := Module[{a, i}, a[0] = 1; If[k == 1, PrimePi[n], Sum[PrimePi[n/Times @@ Prime[Array[a, k - 1]]] - a[k - 1] + 1, Evaluate[ Sequence @@ Table[{a[i], a[i - 1], PrimePi[(n/Times @@ Prime[Array[a, i - 1]])^(1/(k - i + 1))]}, {i, k - 1}]] ]]]; Eric W. Weisstein Feb 07 2006
Do[ Print@ AlmostPrimePi[n, n^n], {n, 13}]
CROSSREFS
Sequence in context: A365183 A371391 A058248 * A292877 A257887 A090367
KEYWORD
hard,more,nonn
AUTHOR
EXTENSIONS
a(13)-a(14) from Donovan Johnson, Oct 05 2010
Definition of T(r,c) corrected. - R. J. Mathar, Jun 20 2021
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 June 6 18:47 EDT 2024. Contains 373134 sequences. (Running on oeis4.)