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.

A380377 Minimum number of total votes needed for one party to win if there are n voters divided into balanced districts, i.e., the numbers of voters in two districts may differ by at most 1.

Table of values

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

List of values

[1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 11, 12, 12, 12, 12, 12, 12, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 17, 18, 18, 18, 18, 18, 18, 18, 19, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 22]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.