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.

A380382 Largest number of districts possible for A380377(n).

Table of values

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

List of values

[1, 2, 3, 3, 5, 5, 5, 7, 7, 7, 9, 9, 9, 11, 11, 11, 5, 13, 13, 15, 15, 15, 7, 7, 17, 5, 5, 19, 9, 9, 9, 9, 23, 23, 11, 11, 11, 11, 11, 27, 13, 13, 13, 13, 13, 13, 9, 9, 9, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 11, 11, 19, 19, 19, 19, 19, 9, 13, 13, 13, 13, 21]

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

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