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.

A325769 Number of integer partitions of n whose distinct consecutive subsequences have different sums.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 6
6 7
7 11
8 12
9 17
10 19
11 29
12 28
13 41
14 42
15 62
16 61
17 88
18 87
19 123
20 121
21 168
22 164
23 234
24 225
25 306
26 306
27 411
28 401
29 527
30 533
31 700
32 689
33 894
34 885
35 1163
36 1150
37 1452
38 1469
39 1866
40 1835
41 2333
42 2346
43 2913
44 2913
45 3638
46 3619
47 4511
48 4537
49 5497
50 5576
51 6859
52 6827
53 8263

List of values

[1, 1, 2, 3, 4, 6, 7, 11, 12, 17, 19, 29, 28, 41, 42, 62, 61, 88, 87, 123, 121, 168, 164, 234, 225, 306, 306, 411, 401, 527, 533, 700, 689, 894, 885, 1163, 1150, 1452, 1469, 1866, 1835, 2333, 2346, 2913, 2913, 3638, 3619, 4511, 4537, 5497, 5576, 6859, 6827, 8263]