cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A069831 Number of graphical partitions of simple Eulerian graphs (partitions given by the degrees of vertices of simple (no loops or multiple edges) graphs having only vertices of even degrees) having n edges.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 1
6 2
7 3
8 3
9 5
10 8
11 10
12 13
13 16
14 22
15 29
16 36
17 45
18 61
19 74
20 95
21 118
22 152
23 183
24 232
25 279
26 354
27 422
28 524
29 627
30 780
31 926
32 1134
33 1355
34 1651
35 1958
36 2366
37 2809
38 3372
39 3988
40 4757
41 5628
42 6678
43 7874
44 9283
45 10964
46 12861
47 15130
48 17686
49 20799
50 24209
51 28389

List of values

[1, 0, 0, 1, 1, 1, 2, 3, 3, 5, 8, 10, 13, 16, 22, 29, 36, 45, 61, 74, 95, 118, 152, 183, 232, 279, 354, 422, 524, 627, 780, 926, 1134, 1355, 1651, 1958, 2366, 2809, 3372, 3988, 4757, 5628, 6678, 7874, 9283, 10964, 12861, 15130, 17686, 20799, 24209, 28389]