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.

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

List of values

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