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.

A243842 Pair deficit of the most equal partition of n into two parts using standard rounding of the expectations of n, floor(n/2) and n-floor(n/2), assuming equal likelihood of states defined by the number of 2-cycles.

Table of values

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

List of values

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