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.

A240057 Number of partitions of n such that (greatest part) is not = (multiplicity of greatest part).

Table of values

n a(n)
1 0
2 2
3 3
4 4
5 6
6 10
7 14
8 21
9 28
10 40
11 53
12 74
13 97
14 131
15 171
16 225
17 290
18 377
19 480
20 616
21 779
22 987
23 1238
24 1556
25 1935
26 2411
27 2981
28 3685
29 4527
30 5562
31 6793
32 8295
33 10081
34 12241
35 14805
36 17890
37 21538
38 25906
39 31062
40 37201
41 44429
42 53004
43 63070
44 74964
45 88898
46 105297

List of values

[0, 2, 3, 4, 6, 10, 14, 21, 28, 40, 53, 74, 97, 131, 171, 225, 290, 377, 480, 616, 779, 987, 1238, 1556, 1935, 2411, 2981, 3685, 4527, 5562, 6793, 8295, 10081, 12241, 14805, 17890, 21538, 25906, 31062, 37201, 44429, 53004, 63070, 74964, 88898, 105297]