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.

A067731 Maximum number of distinct parts in a self-conjugate partition of n, or 0 if n=2.

Table of values

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

List of values

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