A347464 -id:A347464 - cp's OEIS frontend

A347463 Number of ordered factorizations of n with integer alternating product.

1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 4, 1, 1, 1, 7, 1, 4, 1, 4, 1, 1, 1, 6, 2, 1, 3, 4, 1, 1, 1, 11, 1, 1, 1, 18, 1, 1, 1, 6, 1, 1, 1, 4, 4, 1, 1, 20, 2, 4, 1, 4, 1, 6, 1, 6, 1, 1, 1, 8, 1, 1, 4, 26, 1, 1, 1, 4, 1, 1, 1, 35, 1, 1, 4, 4, 1, 1, 1, 20, 7, 1, 1, 8, 1, 1, 1, 6, 1, 8, 1, 4, 1, 1, 1, 32, 1, 4, 4, 18

Offset: 1

Gus Wiseman, Oct 07 2021

nonn

An ordered factorization of n is a sequence of positive integers > 1 with product n.

We define the alternating product of a sequence (y_1,...,y_k) to be Product_i y_i^((-1)^(i-1)).

			The ordered factorizations for n = 4, 8, 12, 16, 24, 32, 36:
  4     8       12      16        24      32          36
  2*2   4*2     6*2     4*4       12*2    8*4         6*6
        2*2*2   2*2*3   8*2       2*2*6   16*2        12*3
                3*2*2   2*2*4     3*2*4   2*2*8       18*2
                        2*4*2     4*2*3   2*4*4       2*2*9
                        4*2*2     6*2*2   4*2*4       2*3*6
                        2*2*2*2           4*4*2       2*6*3
                                          8*2*2       3*2*6
                                          2*2*4*2     3*3*4
                                          4*2*2*2     3*6*2
                                          2*2*2*2*2   4*3*3
                                                      6*2*3
                                                      6*3*2
                                                      9*2*2
                                                      2*2*3*3
                                                      2*3*3*2
                                                      3*2*2*3
                                                      3*3*2*2

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences computed from exponents in factorization of n

Positions of 2's are A001248.
Positions of 1's are A005117.
The restriction to powers of 2 is A116406.
The even-length case is A347048
The odd-length case is A347049.
The unordered version is A347437, reciprocal A347439, reverse A347442.
The case of partitions is A347446, reverse A347445, ranked by A347457.
A001055 counts factorizations (strict A045778, ordered A074206).
A046099 counts factorizations with no alternating permutations.
A103919 counts partitions by sum and alternating sum (reverse: A344612).
A119620 counts partitions with alternating product 1, ranked by A028982.
A273013 counts ordered factorizations of n^2 with alternating product 1.
A339846 counts even-length factorizations, ordered A174725.
A339890 counts odd-length factorizations, ordered A174726.
A347438 counts factorizations with alternating product 1.
A347460 counts possible alternating products of factorizations.
Cf. A025047, A038548, A138364, A347440, A347441, A347453, A347454, A347456, A347458, A347459, A347464, A347705, A347708.

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[Select[Join@@Permutations/@facs[n],IntegerQ[altprod[#]]&]],{n,100}]

A347463(n, m=n, ap=1, e=0) = if(1==n, if(e%2, 1==denominator(ap), 1==numerator(ap)), sumdiv(n, d, if(d>1, A347463(n/d, d, ap * d^((-1)^e), 1-e)))); \\ Antti Karttunen, Jul 28 2024

a(n) = A347048(n) + A347049(n).

Data section extended up to a(100) by Antti Karttunen, Jul 28 2024

A348610 Number of alternating ordered factorizations of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 3, 1, 3, 1, 6, 1, 3, 3, 4, 1, 6, 1, 6, 3, 3, 1, 12, 1, 3, 3, 6, 1, 11, 1, 7, 3, 3, 3, 15, 1, 3, 3, 12, 1, 11, 1, 6, 6, 3, 1, 23, 1, 6, 3, 6, 1, 12, 3, 12, 3, 3, 1, 28, 1, 3, 6, 12, 3, 11, 1, 6, 3, 11, 1, 33, 1, 3, 6, 6, 3, 11, 1, 23, 4, 3

Offset: 1

Gus Wiseman, Nov 05 2021

nonn

An ordered factorization of n is a finite sequence of positive integers > 1 with product n.

A sequence is alternating if it is alternately strictly increasing and strictly decreasing, starting with either. For example, the partition (3,2,2,2,1) has no alternating permutations, even though it does have the anti-run permutations (2,3,2,1,2) and (2,1,2,3,2).

			The alternating ordered factorizations of n = 1, 6, 12, 16, 24, 30, 32, 36:
  ()   6     12      16      24      30      32      36
       2*3   2*6     2*8     3*8     5*6     4*8     4*9
       3*2   3*4     8*2     4*6     6*5     8*4     9*4
             4*3     2*4*2   6*4     10*3    16*2    12*3
             6*2             8*3     15*2    2*16    18*2
             2*3*2           12*2    2*15    2*8*2   2*18
                             2*12    3*10    4*2*4   3*12
                             2*4*3   2*5*3           2*6*3
                             2*6*2   3*2*5           2*9*2
                             3*2*4   3*5*2           3*2*6
                             3*4*2   5*2*3           3*4*3
                             4*2*3                   3*6*2
                                                     6*2*3
                                                     2*3*2*3
                                                     3*2*3*2

Wikipedia, Alternating permutation

The additive version (compositions) is A025047 ranked by A345167.
The complementary additive version is A345192, ranked by A345168.
Dominated by A348611 (the anti-run version) at positions A122181.
The complement is counted by A348613.
A001055 counts factorizations, strict A045778, ordered A074206.
A001250 counts alternating permutations, complement A348615.
A339846 counts even-length factorizations.
A339890 counts odd-length factorizations.
A345165 counts partitions w/o an alternating permutation, ranked by A345171.
A345170 counts partitions w/ an alternating permutation, ranked by A345172.
A347463 counts ordered factorizations with integer alternating product.
A348379 counts factorizations w/ an alternating permutation.
A348380 counts factorizations w/o an alternating permutation.
Cf. A038548, A049774, A056986, A102726, A128761, A344614, A347050, A347464, A347706, A348383.

ordfacs[n_]:=If[n<=1,{{}},Join@@Table[Prepend[#,d]&/@ordfacs[n/d],{d,Rest[Divisors[n]]}]];
wigQ[y_]:=Or[Length[y]==0,Length[Split[y]] == Length[y]&&Length[Split[Sign[Differences[y]]]]==Length[y]-1];
Table[Length[Select[ordfacs[n],wigQ]],{n,100}]

A273013 Number of different arrangements of nonnegative integers on a pair of n-sided dice such that the dice can add to any integer from 0 to n^2-1.

Original entry on oeis.org

1, 1, 1, 3, 1, 7, 1, 10, 3, 7, 1, 42, 1, 7, 7, 35, 1, 42, 1, 42, 7, 7, 1, 230, 3, 7, 10, 42, 1, 115, 1, 126, 7, 7, 7, 393, 1, 7, 7, 230, 1, 115, 1, 42, 42, 7, 1, 1190, 3, 42, 7, 42, 1, 230, 7, 230, 7, 7, 1, 1158, 1, 7, 42, 462, 7, 115, 1, 42, 7, 115, 1, 3030

Offset: 1

Elliott Line, May 13 2016

The set of b values (see formula), and therefore also a(n), depends only on the prime signature of n. So, for example, a(24) will be identical to a(n) of any other n which is also of the form p_1^3*p_2, (e.g., 40, 54, 56).
The value of b_1 will always be 1. When n is prime, the only nonzero b will be b_1, so therefore a(n) will be 1.
In any arrangement, both dice will have a 0, and one will have a 1 (here called the lead die). To determine any one of the actual arrangements to numbers on the dice, select one of the permutations of divisors (for the lead die), then select another permutation that is either the same length as that of the lead die, or one less. For example, if n = 12, we might select 2*3*2 for the lead die, and 3*4 for the second die. These numbers effectively tell you when to "switch track" when numbering the dice, and will uniquely result in the numbering: (0,1,6,7,12,13,72,73,78,79,84,85; 0,2,4,18,20,22,36,38,40,54,56,58).
a(n) is the number of (unordered) pairs of polynomials c(x) = x^c_1 + x^c_2 + ... + x^c_n, d(x) = x^d_1 + x^d_2 + ... + x^d_n with nonnegative integer exponents such that c(x)*d(x) = (x^(n^2)-1)/(x-1). - Alois P. Heinz, May 13 2016
a(n) is also the number of principal reversible squares of order n. - S. Harry White, May 19 2018
From Gus Wiseman, Oct 29 2021: (Start)
Also the number of ordered factorizations of n^2 with alternating product 1. This follows from the author's formula. Taking n instead of n^2 gives a(sqrt(n)) if n is a perfect square, otherwise 0. Here, an ordered factorization of n is a sequence of positive integers > 1 with product n, and the alternating product of a sequence (y_1,...,y_k) is Product_i y_i^((-1)^(i-1)). For example, the a(1) = 1 through a(9) = 3 factorizations are:
  ()  (22)  (33)  (44)    (55)  (66)    (77)  (88)      (99)
                  (242)         (263)         (284)     (393)
                  (2222)        (362)         (482)     (3333)
                                (2233)        (2244)
                                (2332)        (2442)
                                (3223)        (4224)
                                (3322)        (4422)
                                              (22242)
                                              (24222)
                                              (222222)
The even-length case is A347464.
(End)

			When n = 4, a(n) = 3; the three arrangements are (0,1,2,3; 0,4,8,12), (0,1,4,5; 0,2,8,10), (0,1,8,9; 0,2,4,6).
When n = 5, a(n) = 1; the sole arrangement is (0,1,2,3,4; 0,5,10,15,20).

Alois P. Heinz, Table of n, a(n) for n = 1..10000
Matthew C. Lettington and Karl Michael Schmidt, Divisor Functions and the Number of Sum Systems, arXiv:1910.02455 [math.NT], 2019.
S. Harry White, Reversible Squares

Cf. A111588, A131514, A360098.
Positions of 1's are 1 and A000040.
A000290 lists squares, complement A000037.
A001055 counts factorizations, ordered A074206.
A119620 counts partitions with alternating product 1, ranked by A028982.
A339846 counts even-length factorizations, ordered A174725.
A339890 counts odd-length factorizations, ordered A174726.
A347438 counts factorizations with alternating product 1.
A347460 counts possible alternating products of factorizations.
A347463 counts ordered factorizations with integer alternating product.
A347466 counts factorizations of n^2.
Cf. A062312, A347437, A347439, A347440, A347442, A347456, A347459, A347464.

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[Select[Join@@Permutations/@facs[n^2], altprod[#] == 1&]],{n, 30}]
(* Gus Wiseman, Oct 29 2021 *)
(* or *)
ofc[n_,k_] := If[k > PrimeOmega[n], 0, If[k == 0 && n == 1, 1, Sum[ofc[n/d, k-1],{d, Rest[Divisors[n]]}]]];
Table[If[n == 1, 1, Sum[ofc[n, x]^2 + ofc[n, x]*ofc[n, x+1], {x, n}]],{n, 30}]
(* Gus Wiseman, Oct 29 2021, based on author's formula *)

A273013aux(n, k=0, t=1) = if(1==n, (1==t), my(s=0); fordiv(n, d, if((d>1), s += A273013aux(n/d, 1-k, t*(d^((-1)^k))))); (s));
A273013(n) = A273013aux(n^2); \\ Antti Karttunen, Oct 30 2021

@cached_function
def r(m,n):
    if n==1:
        return(1)
    divList = divisors(m)[:-1]
    return(sum(r(n,d) for d in divList))
def A273013(n):
    return(r(n,n)) # William P. Orrick, Feb 19 2023

a(n) = b_1^2 + b_2^2 + b_3^2 + ... + b_1*b_2 + b_2*b_3 + b_3*b_4 + ..., where b_k is the number of different permutations of k divisors of n to achieve a product of n. For example, for n=24, b_3 = 9 (6 permutations of 2*3*4 and 3 permutations of 2*2*6).

a(n) = r(n,n) where r(m,1) = 1 and r(m,n) = Sum_{d|m,dWilliam P. Orrick, Feb 19 2023

A347458 Number of factorizations of n^2 with integer alternating product.

Original entry on oeis.org

1, 2, 2, 4, 2, 6, 2, 8, 4, 6, 2, 17, 2, 6, 6, 15, 2, 17, 2, 16, 6, 6, 2, 41, 4, 6, 8, 16, 2, 31, 2, 27, 6, 6, 6, 56, 2, 6, 6, 39, 2, 31, 2, 17, 17, 6, 2, 90, 4, 17, 6, 17, 2, 41, 6, 39, 6, 6, 2, 105, 2, 6, 17, 48, 6, 31, 2, 17, 6, 31, 2, 148, 2, 6, 17, 17, 6, 32, 2, 86, 15, 6, 2, 107, 6, 6, 6, 40, 2, 109, 6, 17

Offset: 1

Gus Wiseman, Sep 21 2021

nonn

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.
The even-length case, the case of alternating product 1, and the case of alternating sum 0 are all counted by A001055.

			The a(2) = 2 through a(8) = 8 factorizations:
  4     9     16        25    36        49    64
  2*2   3*3   4*4       5*5   6*6       7*7   8*8
              2*2*4           2*2*9           2*4*8
              2*2*2*2         2*3*6           4*4*4
                              3*3*4           2*2*16
                              2*2*3*3         2*2*4*4
                                              2*2*2*2*4
                                              2*2*2*2*2*2

Antti Karttunen, Table of n, a(n) for n = 1..16415

Positions of 2's are A000040, squares A001248.
The restriction to powers of 2 is A344611.
This is the restriction to perfect squares of A347437.
The nonsquared even-length version is A347438.
The reciprocal version is A347459, non-squared A347439.
The additive version (partitions) is the even bisection of A347446.
The nonsquared ordered version is A347463.
The case of alternating product 1 in the ordered version is A347464.
Allowing any alternating product gives A347466.
A000290 lists squares, complement A000037.
A001055 counts factorizations.
A046099 counts factorizations with no alternating permutations.
A071321 gives the alternating sum of prime factors of n (reverse: A071322).
A273013 counts ordered factorizations of n^2 with alternating product 1.
A347460 counts possible alternating products of factorizations.
A339846 counts even-length factorizations.
A339890 counts odd-length factorizations.
A347457 ranks partitions with integer alternating product.
Cf. A062312, A119620, A330972, A346635, A347440, A347441, A347442, A347445, A347451, A347456, A347704, A347705.
Apparently, A006881 gives the positions of 6's. - Antti Karttunen, Oct 22 2023

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[Select[facs[n^2],IntegerQ[altprod[#]]&]],{n,100}]

A347437(n, m=n, ap=1, e=0) = if(1==n, if(e%2, 1==denominator(ap), 1==numerator(ap)), sumdiv(n, d, if((d>1)&&(d<=m), A347437(n/d, d, ap * d^((-1)^e), 1-e))));
A347458(n) = A347437(n*n); \\ Antti Karttunen, Oct 22 2023

a(2^n) = A344611(n).

a(n) = A347437(n^2).

Data section extended up to a(92) by Antti Karttunen, Oct 22 2023

A347459 Number of factorizations of n^2 with integer reciprocal alternating product.

Original entry on oeis.org

1, 1, 1, 3, 1, 4, 1, 6, 3, 4, 1, 11, 1, 4, 4, 12, 1, 11, 1, 12, 4, 4, 1, 28, 3, 4, 6, 12, 1, 19, 1, 22, 4, 4, 4, 38, 1, 4, 4, 29, 1, 21, 1, 12, 11, 4, 1, 65, 3, 11, 4, 12, 1, 29, 4, 29, 4, 4, 1, 71, 1, 4, 11, 40, 4, 22, 1, 12, 4, 18, 1, 107, 1, 4, 11, 12, 4, 22, 1, 66, 12, 4, 1, 76, 4, 4, 4, 30, 1, 71, 4, 12, 4, 4, 4, 141

Offset: 1

Gus Wiseman, Sep 22 2021

nonn

We define the reciprocal alternating product of a sequence (y_1,...,y_k) to be Product_i y_i^((-1)^i).
A factorization of n is a weakly increasing sequence of positive integers > 1 with product n.
All such factorizations have even length.
Image appears to be 1, 3, 4, 6, 11, ... , missing some numbers such as 2, 5, 7, 8, 9, ...
The case of alternating product 1, the case of alternating sum 0, and the reverse version are all counted by A001055.

			The a(2) = 1 through a(10) = 4 factorizations:
    2*2  3*3  2*8      5*5  6*6      7*7  8*8          9*9      2*50
              4*4           2*18          2*32         3*27     5*20
              2*2*2*2       3*12          4*16         3*3*3*3  10*10
                            2*2*3*3       2*2*2*8               2*2*5*5
                                          2*2*4*4
                                          2*2*2*2*2*2

Antti Karttunen, Table of n, a(n) for n = 1..16384

Positions of 1's are 1 and A000040, squares A001248.
The additive version (partitions) is A000041, the even bisection of A119620.
Partitions of this type are ranked by A028982 and A347451.
The restriction to powers of 2 is A236913, the even bisection of A027187.
The nonsquared nonreciprocal even-length version is A347438.
This is the restriction to perfect squares of A347439.
The nonreciprocal version is A347458, non-squared A347437.
A000290 lists squares, complement A000037.
A001055 counts factorizations.
A046099 counts factorizations with no alternating permutations.
A273013 counts ordered factorizations of n^2 with alternating product 1.
A347460 counts possible alternating products of factorizations.
A339846 counts even-length factorizations.
A339890 counts odd-length factorizations.
A347457 ranks partitions with integer alternating product.
A347466 counts factorizations of n^2.
Cf. A062312, A316523, A330972, A344653, A346635, A347440, A347441, A347442, A347453, A347461, A347463, A347464, A347705.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
recaltprod[q_]:=Product[q[[i]]^(-1)^i,{i,Length[q]}];
Table[Length[Select[facs[n^2],IntegerQ[recaltprod[#]]&]],{n,100}]

A347439(n, m=n, ap=1, e=0) = if(1==n, !(e%2) && 1==denominator(ap), sumdiv(n, d, if(d>1 && d<=m, A347439(n/d, d, ap * d^((-1)^e), 1-e))));
A347459(n) = A347439(n^2); \\ Antti Karttunen, Jul 28 2024

a(2^n) = A236913(n).

a(n) = A347439(n^2).

Data section extended up to a(96) by Antti Karttunen, Jul 28 2024

A347466 Number of factorizations of n^2.

Original entry on oeis.org

1, 2, 2, 5, 2, 9, 2, 11, 5, 9, 2, 29, 2, 9, 9, 22, 2, 29, 2, 29, 9, 9, 2, 77, 5, 9, 11, 29, 2, 66, 2, 42, 9, 9, 9, 109, 2, 9, 9, 77, 2, 66, 2, 29, 29, 9, 2, 181, 5, 29, 9, 29, 2, 77, 9, 77, 9, 9, 2, 269, 2, 9, 29, 77, 9, 66, 2, 29, 9, 66, 2, 323, 2, 9, 29, 29

Offset: 1

Gus Wiseman, Sep 23 2021

nonn

A factorization of n is a weakly increasing sequence of positive integers > 1 with product n.

			The a(1) = 1 through a(8) = 11 factorizations:
  ()  (4)    (9)    (16)       (25)   (36)       (49)   (64)
      (2*2)  (3*3)  (2*8)      (5*5)  (4*9)      (7*7)  (8*8)
                    (4*4)             (6*6)             (2*32)
                    (2*2*4)           (2*18)            (4*16)
                    (2*2*2*2)         (3*12)            (2*4*8)
                                      (2*2*9)           (4*4*4)
                                      (2*3*6)           (2*2*16)
                                      (3*3*4)           (2*2*2*8)
                                      (2*2*3*3)         (2*2*4*4)
                                                        (2*2*2*2*4)
                                                        (2*2*2*2*2*2)

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences computed from exponents in factorization of n

Positions of 2's are the primes (A000040), which have squares A001248.
The restriction to powers of 2 is A058696.
The additive version (partitions) is A072213.
The case of integer alternating product is A347459, nonsquared A347439.
A000290 lists squares, complement A000037.
A001055 counts factorizations.
A339846 counts even-length factorizations.
A339890 counts odd-length factorizations.
A347050 = factorizations with alternating permutation, complement A347706.
Cf. A000041, A062312, A120452, A144338, A273013, A330972, A345957, A346635, A347437, A347438, A347457, A347460, A347464.

b:= proc(n, k) option remember; `if`(n>k, 0, 1)+`if`(isprime(n), 0,
      add(`if`(d>k, 0, b(n/d, d)), d=numtheory[divisors](n) minus {1, n}))
    end:
a:= proc(n) option remember; b((l-> mul(ithprime(i)^l[i], i=1..nops(l)))(
      sort(map(i-> i[2], ifactors(n^2)[2]), `>`))$2)
    end:
seq(a(n), n=1..76);  # Alois P. Heinz, Oct 14 2021

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[facs[n^2]],{n,25}]

A001055(n, m=n) = if(1==n, 1, my(s=0); fordiv(n, d, if((d>1)&&(d<=m), s += A001055(n/d, d))); (s));
A347466(n) = A001055(n^2); \\ Antti Karttunen, Oct 13 2021

a(n) = A001055(A000290(n)).

A347048 Number of even-length ordered factorizations of n with integer alternating product.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 4, 0, 0, 0, 7, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 6, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 11, 0, 0, 0, 1, 0, 0, 0, 11, 0, 0, 1, 1, 0, 0, 0, 6, 3, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 8, 0, 1, 1, 7, 0, 0, 0, 1, 0

Offset: 1

Gus Wiseman, Oct 10 2021

nonn

An ordered factorization of n is a sequence of positive integers > 1 with product n.

We define the alternating product of a sequence (y_1,...,y_k) to be Product_i y_i^((-1)^(i-1)).

			The a(n) ordered factorizations for n = 16, 32, 36, 48, 64, 96:
  4*4       8*4       6*6       12*4      8*8           24*4
  8*2       16*2      12*3      24*2      16*4          48*2
  2*2*2*2   2*2*4*2   18*2      2*2*6*2   32*2          3*2*8*2
            4*2*2*2   2*2*3*3   3*2*4*2   2*2*4*4       4*2*6*2
                      2*3*3*2   4*2*3*2   2*2*8*2       6*2*4*2
                      3*2*2*3   6*2*2*2   2*4*4*2       8*2*3*2
                      3*3*2*2             4*2*2*4       12*2*2*2
                                          4*2*4*2       2*2*12*2
                                          4*4*2*2
                                          8*2*2*2
                                          2*2*2*2*2*2

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences computed from exponents in factorization of n

Positions of 0's are A005117 \ {2}.
The restriction to powers of 2 is A027306.
Heinz numbers of partitions of this type are A028260 /\ A347457.
Positions of 3's appear to be A030514.
Positions of 1's are 1 and A082293.
Allowing non-integer alternating product gives A174725, unordered A339846.
The odd-length version is A347049.
The unordered version is A347438, reverse A347439.
Allowing any length gives A347463.
Partitions of this type are counted by A347704, reverse A035363.
A001055 counts factorizations (strict A045778, ordered A074206).
A103919 counts partitions by sum and alternating sum (reverse: A344612).
A119620 counts partitions with alternating product 1, ranked by A028982.
A273013 counts ordered factorizations of n^2 with alternating product 1.
A339890 counts odd-length factorizations, ordered A174726.
A347050 = factorizations with alternating permutation, complement A347706.
A347437 = factorizations with integer alternating product, reverse A347442.
A347446 = partitions with integer alternating product, reverse A347445.
A347460 counts possible alternating products of factorizations.
Cf. A025047, A038548, A116406, A138364, A347440, A347441, A347454, A347456, A347458, A347459, A347464.

ordfacs[n_]:=If[n<=1,{{}},Join@@Table[Prepend[#,d]&/@ordfacs[n/d],{d,Rest[Divisors[n]]}]];
altprod[q_]:=Product[q[[i]]^(-1)^(i-1),{i,Length[q]}];
Table[Length[Select[ordfacs[n],EvenQ[Length[#]]&&IntegerQ[altprod[#]]&]],{n,100}]

A347048(n, m=n, ap=1, e=0) = if(1==n,!(e%2) && 1==numerator(ap), sumdiv(n, d, if(d>1, A347048(n/d, d, ap * d^((-1)^e), 1-e)))); \\ Antti Karttunen, Jul 28 2024

a(n) = A347463(n) - A347049(n).

Data section extended up to a(105) by Antti Karttunen, Jul 28 2024

A347049 Number of odd-length ordered factorizations of n with integer alternating product.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 4, 1, 3, 1, 3, 1, 1, 1, 5, 1, 1, 2, 3, 1, 1, 1, 7, 1, 1, 1, 11, 1, 1, 1, 5, 1, 1, 1, 3, 3, 1, 1, 14, 1, 3, 1, 3, 1, 5, 1, 5, 1, 1, 1, 7, 1, 1, 3, 15, 1, 1, 1, 3, 1, 1, 1, 24, 1, 1, 3, 3, 1, 1, 1, 14, 4, 1, 1, 7, 1, 1, 1, 5, 1, 7, 1, 3, 1, 1, 1, 24, 1, 3, 3, 11

Offset: 1

Gus Wiseman, Oct 10 2021

nonn

An ordered factorization of n is a sequence of positive integers > 1 with product n.

We define the alternating product of a sequence (y_1,...,y_k) to be Product_i y_i^((-1)^(i-1)).

			The a(n) ordered factorizations for n = 2, 8, 12, 16, 24, 32, 36, 48:
  2   8       12      16      24      32          36      48
      2*2*2   2*2*3   2*2*4   2*2*6   2*2*8       2*2*9   2*4*6
              3*2*2   2*4*2   3*2*4   2*4*4       2*3*6   3*2*8
                      4*2*2   4*2*3   4*2*4       2*6*3   3*4*4
                              6*2*2   4*4*2       3*2*6   4*2*6
                                      8*2*2       3*3*4   4*4*3
                                      2*2*2*2*2   3*6*2   6*2*4
                                                  4*3*3   6*4*2
                                                  6*2*3   8*2*3
                                                  6*3*2   12*2*2
                                                  9*2*2   2*2*12
                                                          2*2*2*2*3
                                                          2*2*3*2*2
                                                          3*2*2*2*2

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences computed from exponents in factorization of n

Positions of 2's appear to be A030078.
Positions of 3's appear to be A054753.
Positions of 1's appear to be A167207.
Allowing non-integer alternating product gives A174726, unordered A339890.
The even-length version is A347048.
The unordered version is A347441, with same reverse version.
The case of partitions is A347444, ranked by A347453.
Allowing any length gives A347463.
A001055 counts factorizations (strict A045778, ordered A074206).
A103919 counts partitions by sum and alternating sum (reverse: A344612).
A119620 counts partitions with alternating product 1, ranked by A028982.
A339846 counts even-length factorizations, ordered A174725.
A347050 = factorizations with alternating permutation, complement A347706.
A347437 = factorizations with integer alternating product, reverse A347442.
A347438 = factorizations with alternating product 1, on squares A273013.
A347439 = factorizations with integer reciprocal alternating product.
A347446 = partitions with integer alternating product, reverse A347445.
A347457 lists Heinz numbers of partitions with integer alternating product.
A347460 counts possible alternating products of factorizations.
A347708 counts possible alternating products of odd-length factorizations.
Cf. A025047, A035363, A038548, A116406, A347440, A347454, A347456, A347458, A347459, A347464, A347704.

ordfacs[n_]:=If[n<=1,{{}},Join@@Table[Prepend[#,d]&/@ordfacs[n/d],{d,Rest[Divisors[n]]}]];
altprod[q_]:=Product[q[[i]]^(-1)^(i-1),{i,Length[q]}];
Table[Length[Select[ordfacs[n],OddQ[Length[#]]&&IntegerQ[altprod[#]]&]],{n,100}]

A347049(n, m=n, ap=1, e=0) = if(1==n,(e%2) && 1==denominator(ap), sumdiv(n, d, if(d>1, A347049(n/d, d, ap * d^((-1)^e), 1-e)))); \\ Antti Karttunen, Jul 28 2024

a(n) = A347463(n) - A347048(n).

Data section extended up to a(100) by Antti Karttunen, Jul 28 2024

cp's OEIS Frontend

A347463 Number of ordered factorizations of n with integer alternating product.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A348610 Number of alternating ordered factorizations of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A273013 Number of different arrangements of nonnegative integers on a pair of n-sided dice such that the dice can add to any integer from 0 to n^2-1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

SageMath

Formula

A347458 Number of factorizations of n^2 with integer alternating product.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A347459 Number of factorizations of n^2 with integer reciprocal alternating product.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A347466 Number of factorizations of n^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A347048 Number of even-length ordered factorizations of n with integer alternating product.

Views

Author

Keywords