A353864 - cp's OEIS frontend

A353864 Number of rucksack partitions of n: every consecutive constant subsequence has a different sum.

n	a(n)
0	1
1	1
2	2
3	3
4	4
5	6
6	8
7	11
8	14
9	19
10	25
11	33
12	39
13	51
14	65
15	82
16	101
17	126
18	154
19	191
20	232
21	284
22	343
23	416
24	496
25	600
26	716
27	855
28	1018
29	1209
30	1430
31	1691
32	1991
33	2345
34	2747
35	3224
36	3762
37	4393
38	5116
39	5946
40	6897
41	7998
42	9257
43	10696
44	12336
45	14213
46	16343
47	18781
48	21538
49	24687
50	28253
51	32291
52	36876
53	42057

[1, 1, 2, 3, 4, 6, 8, 11, 14, 19, 25, 33, 39, 51, 65, 82, 101, 126, 154, 191, 232, 284, 343, 416, 496, 600, 716, 855, 1018, 1209, 1430, 1691, 1991, 2345, 2747, 3224, 3762, 4393, 5116, 5946, 6897, 7998, 9257, 10696, 12336, 14213, 16343, 18781, 21538, 24687, 28253, 32291, 36876, 42057]

cp's OEIS Frontend

A353864 Number of rucksack partitions of n: every consecutive constant subsequence has a different sum.

Table of values

List of values