OFFSET
1,8
COMMENTS
a(n) is the number of permutation matrices with a negative contribution to the determinant that is the Möbius function. See A174725 for how the determinant is defined. - Mats Granvik, May 26 2017
From Gus Wiseman, Jan 04 2021: (Start)
Also the number of ordered factorizations of n into an odd number of factors > 1. The unordered case is A339890. For example, the a(n) factorizations for n = 8, 12, 24, 30, 32, 36 are:
(8) (12) (24) (30) (32) (36)
(2*2*2) (2*2*3) (2*2*6) (2*3*5) (2*2*8) (2*2*9)
(2*3*2) (2*3*4) (2*5*3) (2*4*4) (2*3*6)
(3*2*2) (2*4*3) (3*2*5) (2*8*2) (2*6*3)
(2*6*2) (3*5*2) (4*2*4) (2*9*2)
(3*2*4) (5*2*3) (4*4*2) (3*2*6)
(3*4*2) (5*3*2) (8*2*2) (3*3*4)
(4*2*3) (2*2*2*2*2) (3*4*3)
(4*3*2) (3*6*2)
(6*2*2) (4*3*3)
(6*2*3)
(6*3*2)
(9*2*2)
(End)
LINKS
Mats Granvik, Table of n, a(n) for n = 1..10000
FORMULA
MATHEMATICA
ordfacs[n_]:=If[n<=1, {{}}, Join@@Table[(Prepend[#1, d]&)/@ordfacs[n/d], {d, Rest[Divisors[n]]}]];
Table[Length[Select[ordfacs[n], OddQ@*Length]], {n, 100}] (* Gus Wiseman, Jan 04 2021 *)
CROSSREFS
The even version is A174725.
A251683 counts ordered factorizations by product and length.
A340102 counts odd-length factorizations into odd factors.
Other cases of odd length:
- A024429 counts set partitions of odd length.
- A027193 counts partitions of odd length.
- A067659 counts strict partitions of odd length.
- A089677 counts ordered set partitions of odd length.
- A166444 counts compositions of odd length.
- A332304 counts strict compositions of odd length.
KEYWORD
nonn
AUTHOR
Mats Granvik, Mar 28 2010
STATUS
approved