|
Search: id:A129437
|
|
|
| A129437 |
|
Number of isomorphism classes of 8-regular multigraphs of order n, loops allowed. |
|
+0
9
|
|
| 1, 5, 22, 181, 2183, 47773, 1689841, 90972682, 6948008975, 721121538707, 98626660242232
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Computed using software at http://cs.anu.edu.au/~bdm/nauty/
|
|
LINKS
|
R. C. Read, The enumeration of locally restricted graphs (I), J. London Math. Soc. 34 (1959) 417-436. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 09 2009]
|
|
FORMULA
|
a(n)=N\{S_n[S_8] * S_{4n}[S_2]\} [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 09 2009]
|
|
CROSSREFS
|
Cf. A129436, A129426, A129427, A129429, A129431, A129433, A129435
Sequence in context: A009638 A121942 A006294 this_sequence A048252 A066866 A115657
Adjacent sequences: A129434 A129435 A129436 this_sequence A129438 A129439 A129440
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Brendan McKay (bdm(at)cs.anu.edu.au), Apr 15 2007
|
|
EXTENSIONS
|
Using equation (5.8) of Read 1959, McKay's terms verified by, and new term a(11) was computed by Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 09 2009
|
|
|
Search completed in 0.002 seconds
|
