|
| |
|
|
A054916
|
|
Number of connected unlabeled regular graphs with n nodes such that complement is also connected.
|
|
0
| |
|
|
1, 0, 0, 0, 1, 2, 2, 12, 18, 158, 532, 18956, 389418, 50314722, 2942198334, 1698517035792
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
LINKS
| V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
|
|
|
FORMULA
| a(n) = 2*A005177(n)-A005176(n) = A005177(n)-A068932(n)
|
|
|
CROSSREFS
| Sequence in context: A092144 A181813 A059187 * A194767 A202669 A178845
Adjacent sequences: A054913 A054914 A054915 * A054917 A054918 A054919
|
|
|
KEYWORD
| nonn,more,hard
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 23 2000
|
|
|
EXTENSIONS
| Terms a(11)..a(16) appended, journal link changed to article link, second formula included. - Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Oct 24 2009
|
| |
|
|
