|
Search: id:A033483
|
|
|
| A033483 |
|
Number of disconnected 4-valent (or quartic) graphs with n nodes. |
|
+0
4
|
|
| 1, 1, 3, 8, 25, 88, 378, 2026, 13351, 104595, 930586, 9124662, 96699987, 1095469608, 13175272208
(list; graph; listen)
|
|
|
OFFSET
|
10,3
|
|
|
COMMENT
|
Despite A006820(n) being currently unknown for n > 19, we can calculate this sequence A033483(n) up to n = 24, because the smallest 4-regular graph is K_5. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 27 2009]
|
|
REFERENCES
|
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
N. J. A. Sloane, Transforms [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 27 2009]
|
|
FORMULA
|
A033483 = A033301 - A006820 = Euler_transformation(A006820) - A006820. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 27 2009]
|
|
CROSSREFS
|
Cf. A006820, A033301.
Sequence in context: A148798 A148799 A148800 this_sequence A130522 A006219 A009268
Adjacent sequences: A033480 A033481 A033482 this_sequence A033484 A033485 A033486
|
|
KEYWORD
|
nonn,nice,hard,more
|
|
AUTHOR
|
R. C. Read (rcread(AT)math.uwaterloo.ca)
|
|
EXTENSIONS
|
3 more terms from Martin Fuller (martin_n_fuller(AT)btinternet.com), Dec 04 2006
Terms a(19)..a(24) from Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 27 2009
|
|
|
Search completed in 0.002 seconds
|
