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.

A323952 Regular triangle read by rows where if k > 1 then T(n, k) is the number of connected subgraphs of an n-cycle with any number of vertices other than 2 through k - 1, n >= 1, 1 <= k <= n - 1. Otherwise T(n, 1) = n.

Table of values

n a(n)
1 1
2 2
3 3
4 3
5 7
6 4
7 4
8 13
9 9
10 5
11 5
12 21
13 16
14 11
15 6
16 6
17 31
18 25
19 19
20 13
21 7
22 7
23 43
24 36
25 29
26 22
27 15
28 8
29 8
30 57
31 49
32 41
33 33
34 25
35 17
36 9
37 9
38 73
39 64
40 55
41 46
42 37
43 28
44 19
45 10
46 10
47 91
48 81
49 71
50 61
51 51
52 41
53 31
54 21
55 11
56 11
57 111
58 100
59 89
60 78
61 67
62 56
63 45
64 34
65 23
66 12
67 12
68 133
69 121

List of values

[1, 2, 3, 3, 7, 4, 4, 13, 9, 5, 5, 21, 16, 11, 6, 6, 31, 25, 19, 13, 7, 7, 43, 36, 29, 22, 15, 8, 8, 57, 49, 41, 33, 25, 17, 9, 9, 73, 64, 55, 46, 37, 28, 19, 10, 10, 91, 81, 71, 61, 51, 41, 31, 21, 11, 11, 111, 100, 89, 78, 67, 56, 45, 34, 23, 12, 12, 133, 121]