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.

A325687 Triangle read by rows where T(n,k) is the number of length-k compositions of n such that every distinct consecutive subsequence has a different sum.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 0, 1, 1, 4, 4, 0, 1, 1, 5, 5, 0, 0, 1, 1, 6, 12, 4, 0, 0, 1, 1, 7, 12, 5, 0, 0, 0, 1, 1, 8, 25, 8, 4, 0, 0, 0, 1, 1, 9, 24, 12, 3, 0, 0, 0, 0, 1, 1, 10, 40, 32, 8, 4, 0, 0, 0, 0, 1, 1, 11, 41, 41, 6, 3, 0, 0, 0, 0, 0, 1]