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.

A232396 Triangular array read by rows: T(n,k) is the number of compositions of n with no two consecutive identical parts that have exactly k parts = 1, n>=0, 0<=k<=ceiling(n/3).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 2
7 1
8 2
9 1
10 3
11 3
12 1
13 3
14 8
15 3
16 6
17 9
18 7
19 1
20 7
21 20
22 10
23 2
24 14
25 27
26 25
27 5
28 18
29 52
30 39
31 14
32 1
33 30
34 77
35 78
36 26
37 3
38 45
39 132
40 133
41 60
42 8
43 66
44 213
45 240
46 117
47 24
48 1
49 107
50 334
51 421
52 232
53 54
54 4
55 157
56 562
57 716
58 450
59 127
60 12
61 245
62 872
63 1265
64 842
65 279
66 38
67 1

List of values

[1, 0, 1, 1, 0, 1, 2, 1, 2, 1, 3, 3, 1, 3, 8, 3, 6, 9, 7, 1, 7, 20, 10, 2, 14, 27, 25, 5, 18, 52, 39, 14, 1, 30, 77, 78, 26, 3, 45, 132, 133, 60, 8, 66, 213, 240, 117, 24, 1, 107, 334, 421, 232, 54, 4, 157, 562, 716, 450, 127, 12, 245, 872, 1265, 842, 279, 38, 1]