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.

A348447 Irregular triangle read by rows: T(n,k) (n >= 0) is the number of ways of selecting k objects from n objects arranged in a circle with no two selected objects having unit separation (i.e. having exactly one object between them).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 3
8 1
9 4
10 4
11 1
12 5
13 5
14 1
15 6
16 9
17 1
18 7
19 14
20 7
21 1
22 8
23 20
24 16
25 4
26 1
27 9
28 27
29 30
30 9
31 1
32 10
33 35
34 50
35 25
36 1
37 11
38 44
39 77
40 55
41 11
42 1
43 12
44 54
45 112
46 105
47 36
48 4
49 1
50 13
51 65
52 156
53 182
54 91
55 13
56 1
57 14
58 77
59 210
60 294
61 196
62 49
63 1
64 15
65 90
66 275
67 450
68 378
69 140
70 15

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 1, 4, 4, 1, 5, 5, 1, 6, 9, 1, 7, 14, 7, 1, 8, 20, 16, 4, 1, 9, 27, 30, 9, 1, 10, 35, 50, 25, 1, 11, 44, 77, 55, 11, 1, 12, 54, 112, 105, 36, 4, 1, 13, 65, 156, 182, 91, 13, 1, 14, 77, 210, 294, 196, 49, 1, 15, 90, 275, 450, 378, 140, 15]