A325688 - cp's OEIS frontend

A325688 Number of length-3 compositions of n such that every distinct consecutive subsequence has a different sum.

n	a(n)
0	0
1	0
2	0
3	1
4	0
5	4
6	5
7	12
8	12
9	25
10	24
11	40
12	41
13	60
14	60
15	85
16	84
17	112
18	113
19	144
20	144
21	181
22	180
23	220
24	221
25	264
26	264
27	313
28	312
29	364
30	365
31	420
32	420
33	481
34	480
35	544
36	545
37	612
38	612
39	685
40	684
41	760
42	761
43	840
44	840
45	925
46	924
47	1012
48	1013
49	1104
50	1104
51	1201
52	1200
53	1300
54	1301
55	1404

[0, 0, 0, 1, 0, 4, 5, 12, 12, 25, 24, 40, 41, 60, 60, 85, 84, 112, 113, 144, 144, 181, 180, 220, 221, 264, 264, 313, 312, 364, 365, 420, 420, 481, 480, 544, 545, 612, 612, 685, 684, 760, 761, 840, 840, 925, 924, 1012, 1013, 1104, 1104, 1201, 1200, 1300, 1301, 1404]

cp's OEIS Frontend

A325688 Number of length-3 compositions of n such that every distinct consecutive subsequence has a different sum.

Table of values

List of values