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.

A072212 Smallest m such that number of partitions of m exceeds 10^n.

Table of values

n a(n)
1 6
2 13
3 22
4 33
5 46
6 61
7 77
8 95
9 115
10 136
11 160
12 185
13 211
14 240
15 270
16 302
17 335
18 370
19 407
20 445
21 486
22 527
23 571
24 616
25 663
26 711
27 761
28 813
29 867
30 922
31 978
32 1037
33 1097
34 1159
35 1222
36 1287
37 1354
38 1422
39 1492
40 1563
41 1637
42 1711
43 1788
44 1866
45 1946
46 2027
47 2110
48 2195
49 2281

List of values

[6, 13, 22, 33, 46, 61, 77, 95, 115, 136, 160, 185, 211, 240, 270, 302, 335, 370, 407, 445, 486, 527, 571, 616, 663, 711, 761, 813, 867, 922, 978, 1037, 1097, 1159, 1222, 1287, 1354, 1422, 1492, 1563, 1637, 1711, 1788, 1866, 1946, 2027, 2110, 2195, 2281]