Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091059
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091059 Number of n X n matrices over symbol set {1,2} equivalent under any permutation of row, columns or the symbol set. +0
2
1, 1, 5, 18, 173, 2812, 126446, 16821330, 7343033248, 10733521835504, 52867612881649880, 882178115128903807148, 50227997322259477864188380, 9837048598740464300126599181536, 6681839615514161335727724211992609234 (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=2} (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: A009348 A009365 A140296 this_sequence A139243 A139237 A089082

Adjacent sequences: A091056 A091057 A091058 this_sequence A091060 A091061 A091062

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research