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.

A114638 Number of partitions of n such that number of parts is equal to the sum of parts counted without multiplicities.

Table of values

n a(n)
0 1
1 1
2 0
3 0
4 2
5 1
6 1
7 0
8 2
9 2
10 3
11 5
12 5
13 6
14 9
15 7
16 8
17 14
18 12
19 16
20 21
21 28
22 32
23 43
24 47
25 61
26 68
27 84
28 89
29 109
30 126
31 140
32 170
33 198
34 227
35 261
36 323
37 362
38 427
39 501
40 581
41 658
42 794
43 880
44 1036
45 1175
46 1355
47 1526
48 1776
49 1985
50 2281
51 2588
52 2943
53 3312
54 3799
55 4271
56 4852
57 5497

List of values

[1, 1, 0, 0, 2, 1, 1, 0, 2, 2, 3, 5, 5, 6, 9, 7, 8, 14, 12, 16, 21, 28, 32, 43, 47, 61, 68, 84, 89, 109, 126, 140, 170, 198, 227, 261, 323, 362, 427, 501, 581, 658, 794, 880, 1036, 1175, 1355, 1526, 1776, 1985, 2281, 2588, 2943, 3312, 3799, 4271, 4852, 5497]