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.

A243841 Pair deficit of the most nearly equal partition of n into two parts using ceiling 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 1
3 0
4 0
5 0
6 0
7 0
8 -1
9 0
10 0
11 1
12 1
13 0
14 0
15 0
16 1
17 0
18 0
19 0
20 0
21 0
22 -1
23 0
24 0
25 1
26 1
27 1
28 0
29 1
30 1
31 0
32 0
33 0
34 1
35 0
36 0
37 0
38 1
39 1
40 2
41 1
42 0
43 1
44 1
45 1
46 0
47 1
48 1
49 1
50 0
51 1
52 1
53 1

List of values

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