Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A006237
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A006237
Complexity of tensor sum of n graphs; or spanning trees on n-cube.
(Formerly M3725)
+0
2
1, 1, 4, 384, 42467328, 20776019874734407680, 1657509127047778993870601546036901052416000000, 15385084434981466048710053999438117828156794239305576125756067764471886924847513\ 6000000000000000000000
(
list
;
graph
;
listen
)
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 9 14:43 EST 2009. Contains 170430 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
