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.

A373269 T(n,k) is the number of different multiplicities in the k-th partition of n in graded reverse lexicographic ordering (A080577).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 3, 2, 2, 1, 2, 2, 2, 2, 1]