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.

A325768 Number of integer partitions of n for which every restriction to a subinterval has a different sum.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 3
7 5
8 5
9 8
10 7
11 11
12 12
13 15
14 15
15 23
16 22
17 29
18 32
19 40
20 42
21 55
22 56
23 71
24 75
25 92
26 100
27 124
28 128
29 152
30 167
31 198
32 212
33 255
34 269
35 315
36 343
37 392
38 428
39 501
40 529
41 615
42 665
43 757
44 812
45 937
46 1002
47 1142
48 1238
49 1385
50 1490
51 1701
52 1808
53 2038
54 2200
55 2476

List of values

[1, 1, 1, 2, 2, 3, 3, 5, 5, 8, 7, 11, 12, 15, 15, 23, 22, 29, 32, 40, 42, 55, 56, 71, 75, 92, 100, 124, 128, 152, 167, 198, 212, 255, 269, 315, 343, 392, 428, 501, 529, 615, 665, 757, 812, 937, 1002, 1142, 1238, 1385, 1490, 1701, 1808, 2038, 2200, 2476]