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.

A368579 Triangle read by rows. T(n, k) is the number of compositions of n where the first part k is the largest part and the last part is not 1.

Table of values

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

List of values

[1, -1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 2, 2, 1, 0, 1, 0, 0, 3, 3, 2, 1, 0, 1, 0, 0, 5, 6, 4, 2, 1, 0, 1, 0, 0, 8, 11, 7, 4, 2, 1, 0, 1, 0, 0, 13, 20, 14, 8, 4, 2, 1, 0, 1, 0, 0, 21, 37, 27, 15, 8, 4, 2, 1, 0, 1]