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.

A056152 Triangular array giving number of bipartite graphs with n vertices, no isolated vertices and a distinguished bipartite block with k=1..n-1 vertices, up to isomorphism.

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 3
7 1
8 1
9 5
10 5
11 1
12 1
13 8
14 17
15 8
16 1
17 1
18 11
19 42
20 42
21 11
22 1
23 1
24 15
25 91
26 179
27 91
28 15
29 1
30 1
31 19
32 180
33 633
34 633
35 180
36 19
37 1
38 1
39 24
40 328
41 2001
42 3835
43 2001
44 328
45 24
46 1
47 1
48 29
49 565
50 5745
51 20755
52 20755
53 5745
54 565
55 29
56 1
57 1
58 35
59 930
60 15274
61 102089
62 200082
63 102089

List of values

[1, 1, 1, 1, 3, 1, 1, 5, 5, 1, 1, 8, 17, 8, 1, 1, 11, 42, 42, 11, 1, 1, 15, 91, 179, 91, 15, 1, 1, 19, 180, 633, 633, 180, 19, 1, 1, 24, 328, 2001, 3835, 2001, 328, 24, 1, 1, 29, 565, 5745, 20755, 20755, 5745, 565, 29, 1, 1, 35, 930, 15274, 102089, 200082, 102089]