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.

A240177 Number of partitions of n such that (least part) >= (multiplicity of least part).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 4
6 5
7 8
8 10
9 14
10 18
11 24
12 30
13 41
14 51
15 66
16 83
17 106
18 131
19 167
20 204
21 257
22 315
23 391
24 475
25 587
26 710
27 869
28 1049
29 1275
30 1529
31 1852
32 2213
33 2662
34 3173
35 3796
36 4506
37 5373
38 6356
39 7544
40 8900
41 10523
42 12373
43 14585
44 17101
45 20085
46 23494
47 27508
48 32087
49 37471

List of values

[1, 1, 1, 2, 3, 4, 5, 8, 10, 14, 18, 24, 30, 41, 51, 66, 83, 106, 131, 167, 204, 257, 315, 391, 475, 587, 710, 869, 1049, 1275, 1529, 1852, 2213, 2662, 3173, 3796, 4506, 5373, 6356, 7544, 8900, 10523, 12373, 14585, 17101, 20085, 23494, 27508, 32087, 37471]

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

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