Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091060 Number of n X n matrices over symbol set {1,2,3} equivalent under any permutation of row, columns or the symbol set. +0
2
1, 1, 8, 139, 15412, 10805764, 50459685390, 1601741458883376, 355089431048672347272, 563306081052639719480623715, 6532991278768207315727662508956920 (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+...=3} (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))

CROSSREFS

Cf. A091057-A091062.

Sequence in context: A145404 A101388 A050789 this_sequence A092703 A061996 A090931

Adjacent sequences: A091057 A091058 A091059 this_sequence A091061 A091062 A091063

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research