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.

A341319 Minimum number of cells needed in an n X n grid to win a majority of districts when all districts are required to be the same size.

Table of values

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

List of values

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

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

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