|
Search: id:A129435
|
|
|
| A129435 |
|
Number of isomorphism classes of 7-regular multigraphs of order 2n, loops allowed. |
|
+0
9
|
| |
|
|
OFFSET
|
1,1
|
|
|
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_{2n}[S_7] * S_{7n}[S_2]\} [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 09 2009]
|
|
CROSSREFS
|
Cf. A129434, A129424, A129427, A129429, A129431, A129433, A129437
Sequence in context: A052144 A127776 A059105 this_sequence A129702 A091330 A024056
Adjacent sequences: A129432 A129433 A129434 this_sequence A129436 A129437 A129438
|
|
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 were verified by, and new term a(6) was computed by Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 09 2009
|
|
|
Search completed in 0.002 seconds
|
