A325676 - cp's OEIS frontend

A325676 Number of compositions of n such that every distinct consecutive subsequence has a different sum.

n	a(n)
0	1
1	1
2	2
3	4
4	5
5	10
6	12
7	24
8	26
9	47
10	50
11	96
12	104
13	172
14	188
15	322
16	335
17	552
18	590
19	938
20	1002
21	1612
22	1648
23	2586
24	2862
25	4131
26	4418
27	6718
28	7122
29	10332
30	11166
31	15930
32	17446
33	24834
34	26166
35	37146
36	41087
37	55732
38	59592
39	84068
40	89740
41	122106
42	133070
43	177876
44	194024
45	262840
46	278626

[1, 1, 2, 4, 5, 10, 12, 24, 26, 47, 50, 96, 104, 172, 188, 322, 335, 552, 590, 938, 1002, 1612, 1648, 2586, 2862, 4131, 4418, 6718, 7122, 10332, 11166, 15930, 17446, 24834, 26166, 37146, 41087, 55732, 59592, 84068, 89740, 122106, 133070, 177876, 194024, 262840, 278626]

cp's OEIS Frontend

A325676 Number of compositions of n such that every distinct consecutive subsequence has a different sum.

Table of values

List of values