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.

A302099 Decompose the multiplicative group of integers modulo N as a product of cyclic groups C_{k_1} x C_{k_2} x ... x C_{k_m}, where k_i divides k_j for i < j, then a(n) is the smallest N such that the product contains a copy of C_{2n}.

Table of values

n a(n)
1 3
2 5
3 7
4 32
5 11
6 13
7 1247
8 17
9 19
10 25
11 23
12 224
13 4187
14 29
15 31
16 128
17 14111
18 37
19 43739
20 41
21 43
22 115
23 47
24 119
25 15251
26 53
27 81
28 928
29 59
30 61
31 116003
32 256
33 67
34 70555
35 71
36 73
37 33227
38 174269
39 79
40 187
41 83
42 203
43 74563
44 89
45 209
46 235
47 186497
48 97
49 67571
50 101
51 103

List of values

[3, 5, 7, 32, 11, 13, 1247, 17, 19, 25, 23, 224, 4187, 29, 31, 128, 14111, 37, 43739, 41, 43, 115, 47, 119, 15251, 53, 81, 928, 59, 61, 116003, 256, 67, 70555, 71, 73, 33227, 174269, 79, 187, 83, 203, 74563, 89, 209, 235, 186497, 97, 67571, 101, 103]