|
|
A220264
|
|
Smallest integer with exactly n semiprime divisors.
|
|
16
|
|
|
1, 4, 12, 30, 60, 180, 210, 420, 1260, 6300, 2310, 4620, 13860, 69300, 485100, 30030, 60060, 180180, 900900, 6306300, 69369300, 510510, 1021020, 3063060, 15315300, 107207100, 1179278100, 15330615300, 9699690, 19399380, 58198140, 290990700, 2036934900, 22406283900
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Often a(n+1) = k*a(n) for some integer k.
|
|
LINKS
|
|
|
MATHEMATICA
|
semiPrimeQ[n_] := PrimeOmega@ n == 2; f[n_] := Length@ Select[Divisors@ n, semiPrimeQ@# &]; t = Table[0, {50}]; k = 1; While[k < 10^7, a = f@ k; If[t[[a]] == 0, t[[a]] = k; Print[{a, k}]]; k++]; t
|
|
PROG
|
(PARI) prim(n)=my(v=primes(n)); prod(i=1, #v, v[i])
a(n)=if(n>1, my(L=(sqrtint(8*n+1)+1)\2); prim(L)*prim(n-binomial(L, 2)), 1+3*n) \\ Charles R Greathouse IV, Dec 11 2012
(Haskell)
import Data.List (find); import Data.Maybe (fromJust)
a220264 n = fromJust $ find ((== n) . a086971) a220423_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|