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!)
A116434 Consider the array T(r,c), the number of c-almost primes less than or equal to r^c. This is the diagonal T(r,r-1). 1
0, 1, 3, 13, 90, 726, 7089, 78369, 973404, 13377156, 201443165, 3297443264, 58304208767, 1107693755122 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
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 + 1)^n], {n, 11}]
CROSSREFS
Sequence in context: A097711 A114477 A345104 * A174290 A034513 A257661
KEYWORD
hard,more,nonn
AUTHOR
EXTENSIONS
Rephrased NAME. - R. J. Mathar, Jun 20 2021
a(13)-a(14) from Max Alekseyev, Oct 12 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 4 23:31 EST 2024. Contains 370537 sequences. (Running on oeis4.)