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.

A227761 a(n) is the maximal difference between successive parts in the minimally runlength-encoded unordered partition of n (A227368(n)).

Table of values

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

List of values

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