|
|
A014614
|
|
Numbers that are products of 5 primes (or 5-almost primes, a generalization of semiprimes).
|
|
92
|
|
|
32, 48, 72, 80, 108, 112, 120, 162, 168, 176, 180, 200, 208, 243, 252, 264, 270, 272, 280, 300, 304, 312, 368, 378, 392, 396, 405, 408, 420, 440, 450, 456, 464, 468, 496, 500, 520, 552, 567, 588, 592, 594, 612, 616, 630, 656, 660, 675, 680, 684, 688, 696
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Divisible by exactly 5 prime powers (not including 1).
|
|
LINKS
|
|
|
FORMULA
|
Product p_i^e_i with sum e_i = 5.
|
|
MATHEMATICA
|
|
|
PROG
|
(Python)
from math import isqrt
from sympy import primepi, primerange, integer_nthroot
def f(x): return int(n+x-sum(primepi(x//(k*m*r*s))-d for a, k in enumerate(primerange(integer_nthroot(x, 5)[0]+1)) for b, m in enumerate(primerange(k, integer_nthroot(x//k, 4)[0]+1), a) for c, r in enumerate(primerange(m, integer_nthroot(x//(k*m), 3)[0]+1), b) for d, s in enumerate(primerange(r, isqrt(x//(k*m*r))+1), c)))
m, k = n, f(n)
while m != k:
m, k = k, f(k)
|
|
CROSSREFS
|
Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (r = 2), A014612 (r = 3), A014613 (r = 4), this sequence (r = 5), A046306 (r = 6), A046308 (r = 7), A046310 (r = 8), A046312 (r = 9), A046314 (r = 10), A069272 (r = 11), A069273 (r = 12), A069274 (r = 13), A069275 (r = 14), A069276 (r = 15), A069277 (r = 16), A069278 (r = 17), A069279 (r = 18), A069280 (r = 19), A069281 (r = 20). - Jason Kimberley, Oct 02 2011
|
|
KEYWORD
|
nonn,changed
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Scott Lindhurst (ScottL(AT)alumni.princeton.edu) and Patrick De Geest, Jun 15 1998
|
|
STATUS
|
approved
|
|
|
|