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.

A381923 a(n) is the least k >= 2 such that (2^k - 1) mod (n*k - 1) = 0.

Table of values

n a(n)
1 2
2 2
3 12
4 4
5 24
6 216
7 792
8 32
9 144
10 4410
11 396
12 108
13 208
14 1880
15 3192
16 16
17 9240
18 72
19 24
20 6048
21 264
22 2160
23 1872
24 270
25 20916
26 104
27 5292
28 940
29 360
30 1596
31 756
32 8
33 132
34 4620
35 1260
36 36
37 1728
38 12
39 49500
40 3024
41 7560
42 3168
43 1440
44 1080
45 2688
46 936
47 1344
48 1035
49 44100
50 28800

List of values

[2, 2, 12, 4, 24, 216, 792, 32, 144, 4410, 396, 108, 208, 1880, 3192, 16, 9240, 72, 24, 6048, 264, 2160, 1872, 270, 20916, 104, 5292, 940, 360, 1596, 756, 8, 132, 4620, 1260, 36, 1728, 12, 49500, 3024, 7560, 3168, 1440, 1080, 2688, 936, 1344, 1035, 44100, 28800]