Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060336
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060336 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. +0
3
3, 45, 3654, 1929501 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = C(3^n + n - 1, n) (where C(n, k) denotes the binomial coefficient)

CROSSREFS

A060690.

Adjacent sequences: A060333 A060334 A060335 this_sequence A060337 A060338 A060339

Sequence in context: A027637 A099168 A004105 this_sequence A057863 A124488 A086683

KEYWORD

nonn

AUTHOR

Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research