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.

A341578 a(n) is the minimum number of total votes needed for one party to win if there are n^2 voters divided into equal districts.

Table of values

n a(n)
1 1
2 3
3 4
4 8
5 9
6 14
7 16
8 24
9 25
10 33
11 36
12 45
13 49
14 60
15 64
16 80
17 81
18 95
19 100
20 117
21 121
22 138
23 144
24 165
25 169
26 189
27 196
28 224
29 225
30 247
31 256
32 288
33 289
34 315
35 324
36 350
37 361
38 390
39 400
40 429
41 441
42 473
43 484
44 528
45 529
46 564
47 576
48 624
49 625
50 663
51 676
52 728
53 729
54 770
55 784
56 825
57 841
58 885
59 900
60 943

List of values

[1, 3, 4, 8, 9, 14, 16, 24, 25, 33, 36, 45, 49, 60, 64, 80, 81, 95, 100, 117, 121, 138, 144, 165, 169, 189, 196, 224, 225, 247, 256, 288, 289, 315, 324, 350, 361, 390, 400, 429, 441, 473, 484, 528, 529, 564, 576, 624, 625, 663, 676, 728, 729, 770, 784, 825, 841, 885, 900, 943]