0,2

Max Alekseyev, Table of n, a(n) for n = 0..50

Eric Weisstein's World of Mathematics, Almost Prime.

a(n) = a(n-1) + appi3(n-k,[3^n/2^k]), where k = ceil(n*c) with c = log(5/3)/log(5/2) = 0.55749295065024006729857073190835923443... and appi3(k,n) is the number of k-almostprimes not divisible by 3 and not exceeding n. - Max Alekseyev, Jan 06 2008

a(3) = 5 since 3^3 the 5-th 3-almost-prime: {8,12,18,20,27,...}.

AlmostPrimePi[k_Integer /; k > 1, n_] := Module[{a, i}, a[0] = 1; 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 Weisstein (eww(AT)wolfram.com) Feb 07 2006

Table[ AlmostPrimePi[n, 3^n], {n, 2, 37}] (* Robert G. Wilson v *)

(PARI) a(n)=sum(i=1, 3^n, if(bigomega(i)-n, 0, 1))

(PARI code from Max Alekseyev, Jan 06 2008)

{ appi(k, n, m=2) = local(r=0);

if(k==0, return(1));

if(k==1, return(primepi(n)));

forprime(p=m, floor(sqrtn(n, k)+1e-20),

r+=appi(k-1, n\p, p)-(k==2)*(primepi(p)-1));

r }

{ appi3(k, n) = appi(k, n) - if(k>=1, appi(k-1, n\3)) }

a=1; for(n=1, 50, k=ceil(n*c); a+=appi3(n-k, 3^n\2^k); print1(a, ", "); )

Cf. A078840, A078841, A078842, A078844, A078845, A078846.

Adjacent sequences: A078840 A078841 A078842 this_sequence A078844 A078845 A078846

Sequence in context: A131132 A004692 A094926 this_sequence A018068 A120400 A000621

nonn

Benoit Cloitre (benoit7848c(AT)orange.fr) and Paul D. Hanna (pauldhanna(AT)juno.com), Dec 10 2002

a(14)-a(37) from Robert G. Wilson v (rgwv(at)rgwv.com), Feb 09 2006