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.

A167932 Number of partitions of n such that all parts are equal or all parts are distinct.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 4
6 7
7 6
8 9
9 10
10 13
11 13
12 20
13 19
14 25
15 30
16 36
17 39
18 51
19 55
20 69
21 79
22 92
23 105
24 129
25 144
26 168
27 195
28 227
29 257
30 303
31 341
32 395
33 451
34 515
35 588
36 676
37 761
38 867
39 985
40 1120
41 1261
42 1433
43 1611
44 1821
45 2053
46 2307
47 2591
48 2919
49 3266
50 3663
51 4100
52 4587
53 5121
54 5725
55 6381

List of values

[1, 1, 2, 3, 4, 4, 7, 6, 9, 10, 13, 13, 20, 19, 25, 30, 36, 39, 51, 55, 69, 79, 92, 105, 129, 144, 168, 195, 227, 257, 303, 341, 395, 451, 515, 588, 676, 761, 867, 985, 1120, 1261, 1433, 1611, 1821, 2053, 2307, 2591, 2919, 3266, 3663, 4100, 4587, 5121, 5725, 6381]