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.

A380381 Smallest number of districts needed for A380377(n).

Table of values

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

List of values

[1, 1, 1, 3, 1, 4, 5, 3, 3, 3, 3, 8, 9, 3, 3, 3, 5, 5, 13, 3, 3, 3, 7, 7, 5, 5, 5, 3, 9, 9, 9, 9, 3, 3, 5, 5, 5, 7, 7, 3, 12, 12, 13, 13, 13, 5, 5, 9, 9, 7, 7, 7, 7, 5, 5, 5, 5, 11, 11, 11, 11, 7, 7, 7, 7, 7, 9, 9, 13, 13, 13, 13, 21, 21, 5, 5, 5, 7, 7, 7, 11]