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.

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

Table of values

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

List of values

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