|
|
A210345
|
|
The number of degree sequences of simple graphs with n vertices with all even degrees.
|
|
2
|
|
|
1, 1, 2, 3, 7, 14, 36, 74, 201, 425, 1178, 2515, 7063, 15209, 43088, 93382, 266236, 579950, 1661548, 3634062, 10451798, 22935259, 66170288, 145601216, 421164456, 928875440, 2692737120, 5950570725, 17282501978, 38257352346, 111292168834, 246730727752, 718763328317, 1595578916923, 4653944394630
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
a(2n) = A210346(n). For even n, the complementary sequence has all odd degrees.
|
|
LINKS
|
|
|
EXAMPLE
|
For n=3, there are only two degree sequences with all even terms are possible: {0,0,0} and {2,2,2}. Thus, a(3)=2.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|