A329065 - cp's OEIS frontend

A329065 Smallest m_0 such that A118106(m_0) = n; smallest m_0 such that if we write m_0 = Product_{i=1..t} p_i^e_i, then lcm_{1<=i,j<=t, i!=j} ord(p_i,p_j^e_j) = n, where ord(a,r) is the multiplicative order of a modulo r.

n	a(n)
1	1
2	6
3	14
4	10
5	55
6	18
7	203
8	34
9	146
10	22
11	46
12	26
13	689
14	86
15	302
16	51
17	5759
18	38
19	955
20	50
21	98
22	69
23	94
24	288
25	505
26	5462
27	327
28	58
29	466
30	77
31	9305
32	384
33	5447
34	309
35	142
36	74
37	446
38	2933
39	158
40	246
41	3403
42	129
43	862
44	115
45	543
46	141
47	4702
48	119
49	5713
50	453
51	206
52	106
53	5671
54	162
55	605
56	928
57	687
58	118

[1, 6, 14, 10, 55, 18, 203, 34, 146, 22, 46, 26, 689, 86, 302, 51, 5759, 38, 955, 50, 98, 69, 94, 288, 505, 5462, 327, 58, 466, 77, 9305, 384, 5447, 309, 142, 74, 446, 2933, 158, 246, 3403, 129, 862, 115, 543, 141, 4702, 119, 5713, 453, 206, 106, 5671, 162, 605, 928, 687, 118]

cp's OEIS Frontend

A329065 Smallest m_0 such that A118106(m_0) = n; smallest m_0 such that if we write m_0 = Product_{i=1..t} p_i^e_i, then lcm_{1<=i,j<=t, i!=j} ord(p_i,p_j^e_j) = n, where ord(a,r) is the multiplicative order of a modulo r.

Table of values

List of values