|
|
A322363
|
|
Permanent of the matrix [i^(j-1)]_{i,j=1..n}.
|
|
2
|
|
|
1, 3, 48, 6160, 8527540, 159676348608, 48587473295391744, 280486193644638162542592, 35123514116515156931718809604096, 107372634058167343575121983395332766269440, 8905983201619001018383658118740652467256553624043520, 22052482744180702505678193326985890418061231090612350123937628160
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Conjecture:
(i) n+1 | a(n) if and only if n is not congruent to 1 modulo 4.
(ii) For any Fermat prime p, we have a(p-1) == ((p-1)/2)!*p (mod p^2). If n > 1 is neither congruent to 2 modulo 4 nor a Fermat prime, then a(n-1) == 0 (mod n^2).
The author has proved that p | a(p-1) for any odd prime p. This implies that n | a(n) for all n > 2.
|
|
LINKS
|
|
|
EXAMPLE
|
a(2) = 3 since permanent[i^(j-1)]_{i,j=1,2} = 1*2 + 1*1 = 3.
|
|
MATHEMATICA
|
Permanent[m_List]:=With[{v = Array[x, Length[m]]}, Coefficient[Times @@ (m.v), Times @@ v]];
a[n_]:=a[n]=Permanent[Table[i^(j-1), {i, 1, n}, {j, 1, n}]];
Do[Print[n, " ", a[n]], {n, 1, 15}]
|
|
PROG
|
(PARI) a(n) = matpermanent(matrix(n, n, i, j, i^(j-1))); \\ Michel Marcus, Dec 05 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|