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.

A030699 Maximal value of Q(n,m) (number of partitions of n into m distinct summands) for given n.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 2
7 3
8 3
9 4
10 4
11 5
12 7
13 8
14 10
15 12
16 14
17 16
18 19
19 21
20 24
21 27
22 34
23 39
24 47
25 54
26 64
27 72
28 84
29 94
30 108
31 120
32 136
33 150
34 169
35 192
36 221
37 255
38 291
39 333
40 377
41 427
42 480
43 540
44 603
45 674
46 748
47 831
48 918
49 1014
50 1115
51 1226
52 1360
53 1540
54 1729
55 1945
56 2172
57 2432
58 2702
59 3009

List of values

[1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 7, 8, 10, 12, 14, 16, 19, 21, 24, 27, 34, 39, 47, 54, 64, 72, 84, 94, 108, 120, 136, 150, 169, 192, 221, 255, 291, 333, 377, 427, 480, 540, 603, 674, 748, 831, 918, 1014, 1115, 1226, 1360, 1540, 1729, 1945, 2172, 2432, 2702, 3009]