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.

A380378 Triangle read by rows: T(n,k) is the minimum number of total votes needed for one party to win if there are n voters divided into k balanced districts, 1 <= k <= n.

Table of values

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

List of values

[1, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 3, 3, 4, 4, 4, 4, 4, 3, 4, 4, 5, 5, 4, 5, 4, 4, 4, 5, 5, 5, 4, 5, 5, 4, 4, 5, 5, 6, 6, 4, 5, 6, 5, 4, 5, 5, 6, 6, 6, 5, 5, 6, 6, 5, 5, 5, 6, 6, 7, 7, 6, 6, 6, 7, 6, 5, 5, 6, 6, 7, 7, 7, 6, 6, 6, 7, 7, 6, 5, 6, 6, 7, 7]