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.

A054669 Triangular array T(n,k) giving the number of labeled even graphs with n nodes and k edges for n >= 0 and 0 <= k <= n*(n-1-[0 == n mod 2])/2 (with no trailing zeros).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 0
5 0
6 1
7 1
8 0
9 0
10 4
11 3
12 1
13 0
14 0
15 10
16 15
17 12
18 15
19 10
20 0
21 0
22 1
23 1
24 0
25 0
26 20
27 45
28 72
29 160
30 240
31 195
32 120
33 96
34 60
35 15
36 1
37 0
38 0
39 35
40 105
41 252
42 805
43 1935
44 3255
45 4515
46 5481
47 5481
48 4515
49 3255
50 1935
51 805
52 252
53 105
54 35
55 0
56 0
57 1
58 1
59 0
60 0
61 56
62 210
63 672
64 2800
65 9320
66 24087

List of values

[1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 4, 3, 1, 0, 0, 10, 15, 12, 15, 10, 0, 0, 1, 1, 0, 0, 20, 45, 72, 160, 240, 195, 120, 96, 60, 15, 1, 0, 0, 35, 105, 252, 805, 1935, 3255, 4515, 5481, 5481, 4515, 3255, 1935, 805, 252, 105, 35, 0, 0, 1, 1, 0, 0, 56, 210, 672, 2800, 9320, 24087]