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.

A240168 T(n,k) is the number of unlabeled graphs of n vertices and k edges that have endpoints, where an endpoint is a vertex with degree 1.

Table of values

n a(n)
1 0
2 1
3 1
4 1
5 1
6 2
7 2
8 1
9 1
10 2
11 3
12 5
13 4
14 2
15 1
16 1
17 2
18 4
19 8
20 13
21 15
22 16
23 11
24 5
25 2
26 1
27 1
28 2
29 4
30 9
31 19
32 35
33 55
34 75
35 83
36 72
37 51
38 29
39 13
40 5
41 2
42 1
43 1
44 2
45 4
46 10
47 22
48 50
49 105
50 196
51 338
52 511
53 649
54 695
55 627
56 473
57 304
58 172
59 83
60 35
61 14
62 5
63 2
64 1

List of values

[0, 1, 1, 1, 1, 2, 2, 1, 1, 2, 3, 5, 4, 2, 1, 1, 2, 4, 8, 13, 15, 16, 11, 5, 2, 1, 1, 2, 4, 9, 19, 35, 55, 75, 83, 72, 51, 29, 13, 5, 2, 1, 1, 2, 4, 10, 22, 50, 105, 196, 338, 511, 649, 695, 627, 473, 304, 172, 83, 35, 14, 5, 2, 1]