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.

A320348 Number of partition 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 - a_3, ... , a_{m-1} - a_m, a_m are different.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 3
6 2
7 4
8 4
9 4
10 6
11 9
12 7
13 13
14 12
15 13
16 16
17 22
18 17
19 28
20 28
21 31
22 36
23 50
24 45
25 63
26 62
27 74
28 78
29 102
30 92
31 123
32 123
33 146
34 148
35 191
36 181
37 228
38 233
39 280
40 283
41 348
42 350
43 420
44 437
45 518
46 523
47 616
48 641
49 727
50 774
51 884
52 911
53 1038
54 1102
55 1240
56 1292
57 1463
58 1530
59 1715
60 1861
61 2002

List of values

[1, 1, 1, 2, 3, 2, 4, 4, 4, 6, 9, 7, 13, 12, 13, 16, 22, 17, 28, 28, 31, 36, 50, 45, 63, 62, 74, 78, 102, 92, 123, 123, 146, 148, 191, 181, 228, 233, 280, 283, 348, 350, 420, 437, 518, 523, 616, 641, 727, 774, 884, 911, 1038, 1102, 1240, 1292, 1463, 1530, 1715, 1861, 2002]