Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071763
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071763 Number of spanning trees in n X n X n grid. +0
2
1, 384, 8193540096000, 172685928902844729688524604506636288 (list; graph; listen)
OFFSET

1,2

LINKS

W.-J. Tzeng and F. Y. Wu, Spanning Trees on Hypercubic Lattices and Non-orientable Surfaces

FORMULA

a(n) = 2^(n^3-1) / n^3 * product n1=0..n-1 n2=0..n-1 n3=0..n-1 (3- cos(PI*n1/n) - cos(PI*n2/n) - cos(PI*n3/n) ) where n1, n2, n3 are not all 0.

CROSSREFS

Cf. A007341.

Sequence in context: A023098 A008692 A067518 this_sequence A069043 A013591 A065110

Adjacent sequences: A071760 A071761 A071762 this_sequence A071764 A071765 A071766

KEYWORD

nonn

AUTHOR

Sharon Sela (sharonsela(AT)hotmail.com), Jun 04 2002

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research