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.

A157046 Maximum number of partitions of n into exactly k parts, each <= k. a(n) is maximum in each row of A157044.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 2
7 3
8 4
9 5
10 6
11 8
12 10
13 12
14 16
15 19
16 24
17 31
18 37
19 46
20 58
21 70
22 86
23 104
24 127
25 156
26 185
27 222
28 273
29 326
30 392
31 463
32 556
33 669
34 792
35 939
36 1109
37 1317
38 1564
39 1838
40 2156
41 2535
42 2986
43 3514
44 4100
45 4777
46 5577
47 6526
48 7621
49 8847
50 10251
51 11869
52 13807
53 16032
54 18529
55 21370

List of values

[1, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 16, 19, 24, 31, 37, 46, 58, 70, 86, 104, 127, 156, 185, 222, 273, 326, 392, 463, 556, 669, 792, 939, 1109, 1317, 1564, 1838, 2156, 2535, 2986, 3514, 4100, 4777, 5577, 6526, 7621, 8847, 10251, 11869, 13807, 16032, 18529, 21370]