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.

A293595 Triangle read by rows: T(n,k) = number of compositions of n into k parts such that no two cyclically adjacent parts are equal.

Table of values

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

List of values

[1, 1, 0, 1, 2, 0, 1, 2, 0, 0, 1, 4, 0, 0, 0, 1, 4, 6, 2, 0, 0, 1, 6, 6, 4, 0, 0, 0, 1, 6, 12, 10, 0, 0, 0, 0, 1, 8, 18, 16, 10, 2, 0, 0, 0, 1, 8, 24, 40, 20, 6, 0, 0, 0, 0, 1, 10, 30, 52, 50, 18, 0, 0, 0, 0, 0, 1, 10, 42, 84, 90, 50, 14, 2, 0, 0, 0, 0]