Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091058
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091058 Number of n X n matrices over symbol set {1,...,n} equivalent under any permutation of row, columns or the symbol set. +0
3
1, 1, 5, 139, 332034, 173636442196, 27652322898323351716, 2006943506669869627232430791792, 95763314593596534914617136274432901605313744 (list; graph; listen)
OFFSET

0,3

LINKS

C. G. Bower, Explanation of A091057-A091062

FORMULA

a(n) = sum {1*s_1+2*s_2+...=n, 1*t_1+2*t_2+...=n, 1*u_1+2*u_2+...=n} (fix A[s_1, s_2, ...;t_1, t_2, ...;u_1, u_2, ...]/(1^s_1*s_1!*2^s_2*s_2!*...*1^t_1*t_1!*2^t_2*t_2!*...*1^u_1*u_1!*2^u_2*u_2!*...)) where fix A[...] = prod {i, j>=1} ( (sum {d|lcm(i, j)} (d*u_d))^(gcd(i, j)*s_i*t_j))

a(n) asymptotic to n^(n^2)/(n!^3) = A002489(n)/(A000142(n)^3)

CROSSREFS

Cf. A091057-A091062.

Sequence in context: A122911 A103235 A061463 this_sequence A155177 A054323 A061320

Adjacent sequences: A091055 A091056 A091057 this_sequence A091059 A091060 A091061

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Dec 17 2003

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research