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.

A256443 Irregular triangle T(n,k) read by rows: row n gives a smallest partition of n with maximal order (see Comments for precise definition).

Table of values

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

List of values

[1, 2, 3, 4, 2, 3, 6, 3, 4, 3, 5, 4, 5, 2, 3, 5, 5, 6, 3, 4, 5, 1, 3, 4, 5, 3, 4, 7, 3, 5, 7, 4, 5, 7, 2, 3, 5, 7, 5, 6, 7, 3, 4, 5, 7, 1, 3, 4, 5, 7, 2, 3, 4, 5, 7, 4, 5, 6, 7, 3, 5, 7, 8, 1, 3, 5, 7, 8, 4, 5, 7, 9, 1, 4, 5, 7, 9, 4, 5, 7, 11, 2, 3, 5, 7, 11]