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.

A308828 Number of sequences that include all residues modulo n starting with x_0 = 0 and then x_i given recursively by x_{i+1} = a * x_i + c (mod n) where a and c are integers in the interval [0..n-1].

Table of values

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

List of values

[1, 1, 2, 2, 4, 2, 6, 8, 18, 4, 10, 4, 12, 6, 8, 32, 16, 18, 18, 8, 12, 10, 22, 16, 100, 12, 162, 12, 28, 8, 30, 128, 20, 16, 24, 36, 36, 18, 24, 32, 40, 12, 42, 20, 72, 22, 46, 64, 294, 100, 32, 24, 52, 162, 40, 48, 36, 28, 58, 16, 60, 30, 108, 512, 48, 20, 66, 32, 44, 24]