|
|
A321514
|
|
Number of ways to choose a factorization of each integer from 2 to n into factors > 1.
|
|
5
|
|
|
1, 1, 1, 2, 2, 4, 4, 12, 24, 48, 48, 192, 192, 384, 768, 3840, 3840, 15360, 15360, 61440, 122880, 245760, 245760, 1720320, 3440640, 6881280, 20643840, 82575360, 82575360, 412876800, 412876800, 2890137600, 5780275200, 11560550400, 23121100800, 208089907200
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Product_{k = 1..n} A001055(k).
|
|
EXAMPLE
|
The a(8) = 12 ways to choose a factorization of each integer from 2 to 8:
(2)*(3)*(4)*(5)*(6)*(7)*(8)
(2)*(3)*(4)*(5)*(6)*(7)*(2*4)
(2)*(3)*(4)*(5)*(2*3)*(7)*(8)
(2)*(3)*(2*2)*(5)*(6)*(7)*(8)
(2)*(3)*(4)*(5)*(6)*(7)*(2*2*2)
(2)*(3)*(4)*(5)*(2*3)*(7)*(2*4)
(2)*(3)*(2*2)*(5)*(6)*(7)*(2*4)
(2)*(3)*(2*2)*(5)*(2*3)*(7)*(8)
(2)*(3)*(4)*(5)*(2*3)*(7)*(2*2*2)
(2)*(3)*(2*2)*(5)*(6)*(7)*(2*2*2)
(2)*(3)*(2*2)*(5)*(2*3)*(7)*(2*4)
(2)*(3)*(2*2)*(5)*(2*3)*(7)*(2*2*2)
|
|
MATHEMATICA
|
facs[n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[facs[n/d], Min@@#>=d&]], {d, Rest[Divisors[n]]}]];
Table[Array[Length[facs[#]]&, n, 1, Times], {n, 30}]
|
|
CROSSREFS
|
Cf. A001055, A050336, A066723, A076716, A157612, A281113, A300383, A317144, A317145, A321467, A321470, A321471, A321472.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|