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.

A320347 Number of partitions of n into distinct parts (a_1, a_2, ... , a_m) (a_1 > a_2 > ... > a_m and Sum_{k=1..m} a_k = n) such that a1 - a2, a2 - a3, ..., a_{m-1} - a_m are different.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 3
6 3
7 5
8 6
9 6
10 9
11 11
12 10
13 15
14 18
15 19
16 24
17 31
18 29
19 40
20 44
21 51
22 56
23 72
24 69
25 90
26 97
27 114
28 125
29 154
30 151
31 192
32 207
33 237
34 255
35 304
36 314
37 377
38 401
39 457
40 493
41 573
42 596
43 698
44 750
45 845
46 905
47 1034
48 1104
49 1255
50 1354
51 1507
52 1624
53 1817
54 1955
55 2178
56 2357
57 2605
58 2794
59 3077
60 3380

List of values

[1, 1, 2, 2, 3, 3, 5, 6, 6, 9, 11, 10, 15, 18, 19, 24, 31, 29, 40, 44, 51, 56, 72, 69, 90, 97, 114, 125, 154, 151, 192, 207, 237, 255, 304, 314, 377, 401, 457, 493, 573, 596, 698, 750, 845, 905, 1034, 1104, 1255, 1354, 1507, 1624, 1817, 1955, 2178, 2357, 2605, 2794, 3077, 3380]