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.

A341721 a(n) = minimum number of total votes needed for one party to win if there are n voters divided into equal districts.

Table of values

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

List of values

[1, 2, 2, 3, 3, 4, 4, 5, 4, 6, 6, 6, 7, 8, 6, 8, 9, 8, 10, 9, 8, 12, 12, 10, 9, 14, 10, 12, 15, 12, 16, 14, 12, 18, 12, 14, 19, 20, 14, 15, 21, 16, 22, 18, 15, 24, 24, 18, 16, 18, 18, 21, 27, 20, 18, 20, 20, 30, 30, 21, 31, 32, 20, 24, 21, 24, 34, 27, 24, 24, 36, 25, 37, 38, 24]