A127014 - cp's OEIS frontend

A127014 a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).

n	a(n)
1	1
2	3
3	3
4	3
5	19
6	51
7	115
8	115
9	115
10	627
11	627
12	2675
13	2675
14	2675
15	2675
16	35443
17	35443
18	166515
19	166515
20	166515
21	1215091
22	3312243
23	3312243
24	3312243
25	3312243
26	36866675

[1, 3, 3, 3, 19, 51, 115, 115, 115, 627, 627, 2675, 2675, 2675, 2675, 35443, 35443, 166515, 166515, 166515, 1215091, 3312243, 3312243, 3312243, 3312243, 36866675]

cp's OEIS Frontend

A127014 a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).

Table of values

List of values