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.

A294615 a(n) is the smallest prime p such that there is a multiplicative subgroup H of Z/pZ, of odd order and of index 2n, such that for any two cosets H1 and H2 of H, H1 + H2 contains all of (Z/pZ)\0, except that H+H contains all of (Z/pZ)\0 except -H. If no such prime exists, a(n) = 0.

Table of values

n a(n)
1 0
2 29
3 67
4 233
5 491
6 661
7 911
8 0
9 1747
10 2861
11 2531
12 2857
13 7307
14 4733
15 5791
16 7457
17 9011
18 7309
19 14327
20 11801
21 11047
22 14741
23 67391
24 26737
25 16451
26 14717
27 32779
28 41609
29 24071
30 30661

List of values

[0, 29, 67, 233, 491, 661, 911, 0, 1747, 2861, 2531, 2857, 7307, 4733, 5791, 7457, 9011, 7309, 14327, 11801, 11047, 14741, 67391, 26737, 16451, 14717, 32779, 41609, 24071, 30661]