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.

A288772 a(n) is the minimum number of rows from the table described in A286000 that are required to represent the partitions of all positive integers <= n into consecutive parts.

Table of values

n a(n)
1 1
2 2
3 4
4 4
5 6
6 8
7 8
8 8
9 11
10 13
11 13
12 14
13 14
14 17
15 19
16 19
17 19
18 21
19 21
20 24
21 26
22 26
23 26
24 26
25 29
26 29
27 32
28 34
29 34
30 34
31 34
32 34
33 38
34 38
35 41
36 43
37 43
38 43
39 44
40 44
41 44
42 48
43 48
44 51
45 53
46 53
47 53
48 53
49 55
50 55
51 56
52 59
53 59
54 62
55 64
56 64
57 64
58 64
59 64
60 67
61 67
62 67
63 71
64 71
65 74
66 76
67 76
68 76
69 76
70 76
71 76
72 80
73 80
74 80
75 84
76 84
77 87
78 89
79 89
80 89
81 89

List of values

[1, 2, 4, 4, 6, 8, 8, 8, 11, 13, 13, 14, 14, 17, 19, 19, 19, 21, 21, 24, 26, 26, 26, 26, 29, 29, 32, 34, 34, 34, 34, 34, 38, 38, 41, 43, 43, 43, 44, 44, 44, 48, 48, 51, 53, 53, 53, 53, 55, 55, 56, 59, 59, 62, 64, 64, 64, 64, 64, 67, 67, 67, 71, 71, 74, 76, 76, 76, 76, 76, 76, 80, 80, 80, 84, 84, 87, 89, 89, 89, 89]