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.

A297877 Triangle T(n,k) read by rows, giving number of bipartite graphs with n nodes (n >= 0) and k edges (0 <= k <= floor(n/2*n/2)).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 2
10 2
11 1
12 1
13 1
14 2
15 3
16 4
17 1
18 1
19 1
20 1
21 2
22 4
23 7
24 8
25 6
26 3
27 2
28 1
29 1
30 1
31 2
32 4
33 8
34 13
35 19
36 14
37 13
38 7
39 4
40 1
41 1
42 1
43 1
44 2
45 4
46 9
47 16
48 32
49 45
50 52
51 48
52 40
53 24
54 16
55 7
56 3
57 2
58 1
59 1
60 1
61 2
62 4
63 9
64 17
65 38
66 70
67 120
68 150
69 179
70 164
71 143
72 94
73 63
74 32
75 19
76 7
77 4
78 1
79 1
80 1
81 1
82 2
83 4
84 9
85 18
86 41
87 85
88 181
89 324
90 500
91 659

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 4, 1, 1, 1, 1, 2, 4, 7, 8, 6, 3, 2, 1, 1, 1, 2, 4, 8, 13, 19, 14, 13, 7, 4, 1, 1, 1, 1, 2, 4, 9, 16, 32, 45, 52, 48, 40, 24, 16, 7, 3, 2, 1, 1, 1, 2, 4, 9, 17, 38, 70, 120, 150, 179, 164, 143, 94, 63, 32, 19, 7, 4, 1, 1, 1, 1, 2, 4, 9, 18, 41, 85, 181, 324, 500, 659]