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.

A277231 Irregular triangular array T(n, k) giving in row n the so-called slope of the Ferrers diagram of the k-th partition of n into distinct parts. The partitions of n are taken in Abramowitz-Stegun order but with decreasing parts. See a comment for the definition of this 'slope'.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 1
7 1
8 1
9 2
10 1
11 1
12 1
13 3
14 1
15 1
16 1
17 2
18 1
19 1
20 1
21 1
22 1
23 1
24 2
25 1
26 1
27 1
28 1
29 2
30 1
31 1
32 3
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 2
41 1
42 4
43 1
44 1
45 1
46 1
47 1
48 2
49 1
50 1
51 1
52 1
53 2
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61 1
62 1
63 1
64 2
65 1
66 1
67 3
68 1
69 2
70 1
71 1
72 1
73 1
74 1
75 1
76 2
77 1
78 1
79 1
80 1
81 1
82 1
83 2
84 1
85 1
86 1
87 3
88 1
89 1
90 1
91 1
92 1
93 1
94 1
95 1
96 1
97 1
98 1
99 2
100 1
101 1
102 1
103 1
104 2
105 1
106 1
107 2
108 1
109 4
110 1
111 1
112 1
113 1
114 1
115 1
116 1
117 2
118 1
119 1
120 1
121 1
122 1
123 1
124 1
125 1
126 2
127 1
128 1
129 3
130 1
131 1
132 1
133 1
134 2
135 1
136 5

List of values

[1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 2, 1, 5]