|
%I #12 Jul 30 2017 22:51:26
%S 3,45,3654,1929501,7355513529,212787633478239,47937678641708357304,
%T 85524882506287709213421693,1224201212028616655577478516173315,
%U 142132497715474639139076246298436794277130
%N Number of n X n {-1,0,1} matrices modulo rows permutation (by symmetry this is the same as the number of {-1,0,1} matrices modulo columns permutation), i.e., the number of equivalence classes where two matrices A and B are equivalent if one of them is the result of permuting the rows of the other.
%H Harry J. Smith, <a href="/A060336/b060336.txt">Table of n, a(n) for n = 1..47</a>
%F a(n) = C(3^n + n - 1, n) (where C(n, k) denotes the binomial coefficient).
%F a(n) ~ 3^(n^2) / n!. - _Vaclav Kotesovec_, Jul 02 2016
%t Table[Binomial[3^n+n-1,n],{n,10}] (* _Harvey P. Dale_, Apr 10 2012 *)
%o (PARI) { for (n=1, 47, write("b060336.txt", n, " ", binomial(3^n + n - 1, n)); ) } \\ _Harry J. Smith_, Jul 03 2009
%Y A060690.
%K nonn
%O 1,1
%A Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001
%E More terms from _Harry J. Smith_, Jul 03 2009
|
