A306826 - cp's OEIS frontend

A306826 a(0) = 1; a(n) is the smallest integer k > a(n-1) such that 2^(k-1) == 1 (mod a(n-1)*k).

n	a(n)
0	1
1	3
2	5
3	13
4	37
5	73
6	109
7	181
8	541
9	1621
10	4861
11	9721
12	10531
13	17551
14	29251
15	87751
16	526501
17	3159001
18	5528251
19	11056501
20	44226001
21	49385701
22	98771401
23	172849951
24	345699901
25	352755001
26	564408001
27	634959001
28	793698751
29	793886887
30	4763321317
31	4822127753

[1, 3, 5, 13, 37, 73, 109, 181, 541, 1621, 4861, 9721, 10531, 17551, 29251, 87751, 526501, 3159001, 5528251, 11056501, 44226001, 49385701, 98771401, 172849951, 345699901, 352755001, 564408001, 634959001, 793698751, 793886887, 4763321317, 4822127753]

cp's OEIS Frontend

A306826 a(0) = 1; a(n) is the smallest integer k > a(n-1) such that 2^(k-1) == 1 (mod a(n-1)*k).

Table of values

List of values