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.

A366509 a(n) is the maximum number of dots on the slope of a Ferrers diagram of a partition of n into distinct parts.

Table of values

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

List of values

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