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.

A296167 Triangle read by rows: T(n,k) is the number of circular compositions of n with length k such that no two adjacent parts are equal (1 <= k <= n).

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 1
6 0
7 1
8 1
9 0
10 0
11 1
12 2
13 0
14 0
15 0
16 1
17 2
18 2
19 1
20 0
21 0
22 1
23 3
24 2
25 1
26 0
27 0
28 0
29 1
30 3
31 4
32 3
33 0
34 0
35 0
36 0
37 1
38 4
39 6
40 4
41 2
42 1
43 0
44 0
45 0
46 1
47 4
48 8
49 11
50 4
51 1
52 0
53 0
54 0
55 0
56 1
57 5
58 10
59 13
60 10
61 3
62 0
63 0
64 0
65 0
66 0
67 1
68 5
69 14
70 22
71 18
72 10
73 2
74 1
75 0
76 0
77 0
78 0
79 1
80 6
81 16
82 29
83 32
84 20
85 6
86 1
87 0
88 0
89 0
90 0
91 0
92 1
93 6
94 20
95 44
96 50
97 40
98 18
99 4
100 0
101 0
102 0
103 0
104 0
105 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 2, 0, 0, 0, 1, 2, 2, 1, 0, 0, 1, 3, 2, 1, 0, 0, 0, 1, 3, 4, 3, 0, 0, 0, 0, 1, 4, 6, 4, 2, 1, 0, 0, 0, 1, 4, 8, 11, 4, 1, 0, 0, 0, 0, 1, 5, 10, 13, 10, 3, 0, 0, 0, 0, 0, 1, 5, 14, 22, 18, 10, 2, 1, 0, 0, 0, 0, 1, 6, 16, 29, 32, 20, 6, 1, 0, 0, 0, 0, 0, 1, 6, 20, 44, 50, 40, 18, 4, 0, 0, 0, 0, 0, 0]