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.

A139767 Let e = 2n+1; consider the cyclotomic cosets C_i of 2 mod e; a(n) = maximal value of minimal number of copies of C_1 needed to add together to get any coset C_i.

Table of values

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

List of values

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