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.

A263296 Triangle read by rows: T(n,k) is the number of graphs with n vertices with edge connectivity k.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 1
7 5
8 3
9 2
10 1
11 13
12 10
13 8
14 2
15 1
16 44
17 52
18 41
19 15
20 3
21 1
22 191
23 351
24 352
25 121
26 25
27 3
28 1
29 1229
30 3714
31 4820
32 2159
33 378
34 41
35 4
36 1
37 13588
38 63638
39 113256
40 68715
41 14306
42 1095
43 65
44 4
45 1
46 288597
47 1912203
48 4602039
49 3952378
50 1141575
51 104829
52 3441
53 100
54 5
55 1

List of values

[1, 1, 1, 2, 1, 1, 5, 3, 2, 1, 13, 10, 8, 2, 1, 44, 52, 41, 15, 3, 1, 191, 351, 352, 121, 25, 3, 1, 1229, 3714, 4820, 2159, 378, 41, 4, 1, 13588, 63638, 113256, 68715, 14306, 1095, 65, 4, 1, 288597, 1912203, 4602039, 3952378, 1141575, 104829, 3441, 100, 5, 1]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.