cp's OEIS Frontend

The interval (a(n), A232553(n)) contains no permanents of the matrices under consideration. For n=3 and n=4, the permanent takes only one value: 6 and 9 respectively. Our method (see Shevelev link) allows us to find a simple regularity of the sequence only beginning with n=30 (see formula). However, several values for 5<=n<30 are known: a(5)=13, a(6)=20, a(7)=32, a(8)=78, a(9)=120, a(12)=729, a(15)=4374, a(18)=26244, a(21)=157464, a(24)=944784, a(27)=5668704 (Bolshakov) and a(28)=8957952.

We conjecture that formula below also holds for other values.

In cases n==0 (nod 3), n>=6, and n==2 (mod 3), at least, for n=8 and n>=32, the second largest value of permanent attains on subset of symmetric matrices with the main diagonal of 1's, and does not attain, if n==1 (mod 3), at least, for n=7 and n>=28.

All terms for n>30 not divisible by 3 are conjectural since our method is based on the following very plausible but yet not proved conjecture with confirms in many cases and without counterexample since 1992 (when it was posed, see ref. [11] in Shevelev link). Let L_n be the set of considered n X n (0,1)-matrices with all row and column sums equal to 3. Let S_n be the subset of completely indecomposable such matrices, i.e., not containing submatrices from L_m (m