A309906 - cp's OEIS frontend

A309906 a(n) is the smallest number of divisors of p^n - 1 that may possibly occur for arbitrarily large primes p.

n	a(n)
1	4
2	32
3	8
4	160
5	8
6	384
7	8
8	384
9	16
10	256
11	8
12	7680
13	8
14	128
15	32
16	1792
17	8
18	4096
19	8
20	3840
21	32
22	256
23	8
24	36864
25	16
26	128
27	32
28	2560
29	8
30	24576
31	8
32	4096
33	32
34	128
35	32
36	327680
37	8
38	128
39	32
40	36864
41	8
42	18432
43	8
44	2560
45	128
46	256
47	8
48	344064
49	16
50	1024
51	32
52	2560
53	8
54	20480
55	32

[4, 32, 8, 160, 8, 384, 8, 384, 16, 256, 8, 7680, 8, 128, 32, 1792, 8, 4096, 8, 3840, 32, 256, 8, 36864, 16, 128, 32, 2560, 8, 24576, 8, 4096, 32, 128, 32, 327680, 8, 128, 32, 36864, 8, 18432, 8, 2560, 128, 256, 8, 344064, 16, 1024, 32, 2560, 8, 20480, 32]

cp's OEIS Frontend

A309906 a(n) is the smallest number of divisors of p^n - 1 that may possibly occur for arbitrarily large primes p.

Table of values

List of values