A252669 - cp's OEIS frontend

A252669 a(n) is the smallest integer k such that n*k mod (n+k) = 1, or -1 if no such k exists.

n	a(n)
1	1
2	3
3	2
4	13
5	8
6	31
7	3
8	5
9	32
10	91
11	50
12	17
13	4
14	183
15	98
16	241
17	12
18	7
19	162
20	381
21	5
22	75
23	30
24	553
25	288
26	651
27	46
28	129
29	392
30	23
31	6
32	9
33	76
34	55
35	578
36	1261
37	100
38	47
39	722
40	1561
41	17
42	311
43	7
44	105
45	968
46	27
47	18
48	413
49	1152
50	11
51	1250
52	489
53	228
54	2863
55	34
56	3081
57	8
58	615
59	1682
60	217
61	1800
62	707

[1, 3, 2, 13, 8, 31, 3, 5, 32, 91, 50, 17, 4, 183, 98, 241, 12, 7, 162, 381, 5, 75, 30, 553, 288, 651, 46, 129, 392, 23, 6, 9, 76, 55, 578, 1261, 100, 47, 722, 1561, 17, 311, 7, 105, 968, 27, 18, 413, 1152, 11, 1250, 489, 228, 2863, 34, 3081, 8, 615, 1682, 217, 1800, 707]

cp's OEIS Frontend

A252669 a(n) is the smallest integer k such that n*k mod (n+k) = 1, or -1 if no such k exists.

Table of values

List of values