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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119966 The n-almost primeth recurrence: a(0) = 1, a(n) = n-almostprime(a(n-1)). 1
1, 2, 6, 28, 220, 2565, 45846, 1268622, 55336336, 3876385680, 443603651136, 84205632289664 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

EXAMPLE

a(0)=1, a(1) is the first prime 2, a(2) is the second semiprime 6, a(3) is the sixth 3-almost prime 28, etc.

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 (eww(AT)wolfram.com) Feb 07 2006 *)

AlmostPrime[k_Integer, n] = Block[{e = Floor[ Log[2, n] + 1], a, b}, a = 2^e; Do[b = 2^p; While[AlmostPrimePi[k, a] < n, a = a + b]; a = a - b/2, {p, e, 0, -1}]; a + b/2];

CROSSREFS

Cf. A007097, A105999, A119965.

Sequence in context: A093657 A006117 A118025 * A002047 A126340 A136639

Adjacent sequences:  A119963 A119964 A119965 * A119967 A119968 A119969

KEYWORD

nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), May 31 2006

EXTENSIONS

a(10)-a(11) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 18 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:16 EST 2012. Contains 205856 sequences.