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.

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

List of values

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