|
|
A347708
|
|
Number of distinct possible alternating products of odd-length factorizations of n.
|
|
6
|
|
|
0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 2, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 2, 1, 2, 2, 1, 1, 4, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 1, 5, 1, 1, 2, 3, 1, 2, 1, 2, 1, 2, 1, 5, 1, 1, 2, 2, 1, 2, 1, 4, 2, 1, 1, 5, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
We define the alternating product of a sequence (y_1,...,y_k) to be Product_i y_i^((-1)^(i-1)).
A factorization of n is a weakly increasing sequence of positive integers > 1 with product n.
Note that it is sufficient to look at only length-1 and length-3 factorizations; cf. A347709.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Representative factorizations for each of the a(180) = 7 alternating products:
(2*2*3*3*5) -> 5
(2*2*45) -> 45
(2*3*30) -> 20
(2*5*18) -> 36/5
(2*9*10) -> 20/9
(3*4*15) -> 45/4
(180) -> 180
|
|
MATHEMATICA
|
facs[n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[facs[n/d], Min@@#>=d&]], {d, Rest[Divisors[n]]}]];
altprod[q_]:=Product[q[[i]]^(-1)^(i-1), {i, Length[q]}];
Table[Length[Union[altprod/@Select[facs[n], OddQ[Length[#]]&]]], {n, 100}]
|
|
CROSSREFS
|
Positions of 1's appear to be A037143 \ {1}.
A276024 counts distinct positive subset-sums of partitions.
A301957 counts distinct subset-products of prime indices.
A304792 counts distinct subset-sums of partitions.
A347050 = factorizations w/ an alternating permutation, complement A347706.
A347441 counts odd-length factorizations with integer alternating product.
Cf. A002033, A103919, A108917, A119620, A325770, A339846, A339890, A347437, A347438, A347439, A347440, A347442, A347456.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|