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.

A240055 Number of partitions of n such that (number of distinct parts) = m(1) - m(2), where m = multiplicity.

Table of values

n a(n)
0 1
1 1
2 0
3 0
4 0
5 2
6 1
7 1
8 3
9 2
10 4
11 5
12 7
13 6
14 14
15 11
16 17
17 22
18 30
19 28
20 45
21 55
22 61
23 78
24 103
25 114
26 147
27 183
28 202
29 269
30 316
31 372
32 446
33 565
34 631
35 778
36 935
37 1096
38 1283
39 1586
40 1791
41 2166
42 2558
43 2991
44 3478
45 4182
46 4821
47 5616
48 6660
49 7716
50 8933
51 10532
52 12155
53 14058
54 16482

List of values

[1, 1, 0, 0, 0, 2, 1, 1, 3, 2, 4, 5, 7, 6, 14, 11, 17, 22, 30, 28, 45, 55, 61, 78, 103, 114, 147, 183, 202, 269, 316, 372, 446, 565, 631, 778, 935, 1096, 1283, 1586, 1791, 2166, 2558, 2991, 3478, 4182, 4821, 5616, 6660, 7716, 8933, 10532, 12155, 14058, 16482]