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.

A367566 a(n) is the product of the primes p <= n+1 such that n * k^n == +-1 (mod p) for every k that is not a multiple of p.

Table of values

n a(n)
1 2
2 3
3 2
4 15
5 6
6 35
7 6
8 3
9 2
10 33
11 6
12 13
13 6
14 15
15 14
16 255
17 6
18 19
19 6
20 3
21 2
22 69
23 6
24 5
25 6
26 15
27 14
28 87
29 6
30 31
31 6
32 3
33 2
34 15
35 6
36 1295
37 6
38 3
39 2
40 123
41 6
42 43
43 6
44 15
45 22
46 705
47 6
48 7
49 6
50 3
51 2
52 159
53 6
54 5
55 6
56 15
57 14
58 177
59 6
60 61
61 6
62 3
63 2
64 15
65 66
66 4355
67 6
68 3
69 14
70 213
71 6
72 73
73 6

List of values

[2, 3, 2, 15, 6, 35, 6, 3, 2, 33, 6, 13, 6, 15, 14, 255, 6, 19, 6, 3, 2, 69, 6, 5, 6, 15, 14, 87, 6, 31, 6, 3, 2, 15, 6, 1295, 6, 3, 2, 123, 6, 43, 6, 15, 22, 705, 6, 7, 6, 3, 2, 159, 6, 5, 6, 15, 14, 177, 6, 61, 6, 3, 2, 15, 66, 4355, 6, 3, 14, 213, 6, 73, 6]