Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091511
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091511 Number of n X n X n 3-D matrices over symbol set {1,...,n} equivalent under any permutation of rows, columns, stacks or the symbol set. +0
2
1, 1, 5, 5887172299, 1025638889935309161425800069552344, 11337715575060644543768059040620852798601554512475786008052416860406653219312996 (list; graph; listen)
OFFSET

0,3

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, 1*v_1+2*v_2+...=n} (fix A[s_1, s_2, ...;t_1, t_2, ...;u_1, u_2, ...;v_1, v_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!*...*1^v_1*v_1!*2^v_2*v_2!*...)) where fix A[...] = prod {i, j, k>=1} ( (sum {d|lcm(i, j, k)} (d*v_d))^(s_i*t_j*u_k*lcm(i, j, k)/(i*j*k)))

a(n) asymptotic to n^(n^3)/(n!^4)

CROSSREFS

Cf. A091058, A091510.

Sequence in context: A115763 A052000 A094467 this_sequence A067483 A102638 A005872

Adjacent sequences: A091508 A091509 A091510 this_sequence A091512 A091513 A091514

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jan 16 2004

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research