A120045
The (10^n)-th 4-almost prime.
Original entry on oeis.org
16, 88, 693, 5958, 54328, 511725, 4922511, 47997635, 472514554, 4683086217, 46636297326, 466032880556
Offset: 0
-
FourAlmostPrimePi[n_] := Sum[ PrimePi[n/(Prime@i*Prime@j*Prime@k)] - k + 1, {i, PrimePi[n^(1/4)]}, {j, i, PrimePi[(n/Prime@i)^(1/3)]}, {k, j, PrimePi@Sqrt[n/(Prime@i*Prime@j)]}];
FourAlmostPrime[n_] := Block[{e = Floor[Log[2, n] +3], a, b}, a = 2^e; Do[b = 2^p; While[FourAlmostPrimePi[a] < n, a = a + b]; a = a - b/2, {p, e, 0, -1}]; a + b/2]; Do[ Print@FourAlmostPrime[10^n], {n, 0, 11}]
A120046
The 10^n-th 5-almost prime.
Original entry on oeis.org
32, 176, 1272, 10374, 89896, 810220, 7475818, 70185558, 667561977, 6411296283, 62037096770, 603813941738
Offset: 0
-
FiveAlmostPrimePi[n_] := Sum[ PrimePi[n/(Prime@i*Prime@j*Prime@k*Prime@l)] - l + 1, {i, PrimePi[n^(1/5)]}, {j, i, PrimePi[(n/Prime@i)^(1/4)]}, {k, j, PrimePi[(n/(Prime@i*Prime@j)^(1/3))]}, {l, k, PrimePi@Sqrt[(n/(Prime@i*Prime@j*Prime@k))]}];
FiveAlmostPrime[n_] := Block[{e = Floor[Log[2, n] +4], a, b}, a = 2^e; Do[b = 2^p; While[FiveAlmostPrimePi[a] < n, a = a + b]; a = a - b/2, {p, e, 0, -1}]; a + b/2]; Do[ Print@FiveAlmostPrime[10^n], {n, 0, 13}]
-
lista(nmax) = {my(pow = 1, c = 0, n = 0); for(k = 1, oo, if(bigomega(k) == 5, c++; if(c == pow, print1(k, ", "); if(n == nmax, break); pow *= 10; n++)));} \\ Amiram Eldar, Apr 29 2024
a(6) corrected and a(7)-a(9) added by
Amiram Eldar, Apr 29 2024
Showing 1-2 of 2 results.