|
Search: id:A054916
|
|
|
| A054916 |
|
Number of connected unlabeled regular graphs with n nodes such that complement is also connected. |
|
+0
1
|
|
| 1, 0, 0, 0, 1, 2, 2, 12, 18, 158, 532, 18956, 389418, 50314722, 2942198334, 1698517035792
(list; graph; listen)
|
|
|
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: A025527 A092144 A059187 this_sequence A140431 A092900 A164961
Adjacent sequences: A054913 A054914 A054915 this_sequence 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
|
|
|
Search completed in 0.002 seconds
|
