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.

A240178 Number of partitions of n such that (least part) < (multiplicity of greatest part).

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 1
5 2
6 3
7 4
8 5
9 7
10 9
11 13
12 16
13 22
14 27
15 36
16 44
17 59
18 71
19 93
20 114
21 144
22 176
23 223
24 268
25 336
26 407
27 502
28 605
29 744
30 891
31 1088
32 1301
33 1574
34 1879
35 2265
36 2687
37 3224
38 3822
39 4557
40 5384
41 6399
42 7535
43 8921
44 10481
45 12354
46 14481
47 17022
48 19888
49 23307
50 27178
51 31745

List of values

[0, 0, 1, 1, 1, 2, 3, 4, 5, 7, 9, 13, 16, 22, 27, 36, 44, 59, 71, 93, 114, 144, 176, 223, 268, 336, 407, 502, 605, 744, 891, 1088, 1301, 1574, 1879, 2265, 2687, 3224, 3822, 4557, 5384, 6399, 7535, 8921, 10481, 12354, 14481, 17022, 19888, 23307, 27178, 31745]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.