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.

A308972 Least k > 0 such that A114561(k) == A114561(k+1) mod n.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 2
9 1
10 2
11 3
12 1
13 2
14 1
15 2
16 2
17 2
18 1
19 2
20 2
21 1
22 3
23 4
24 2
25 3
26 2
27 2
28 1
29 2
30 2
31 3
32 2
33 3
34 2
35 2
36 1
37 2
38 2
39 2
40 2
41 3
42 1
43 2
44 3
45 2
46 4
47 5
48 2
49 2
50 3
51 2
52 2
53 3
54 2
55 3
56 2
57 2
58 2
59 3
60 2
61 3
62 3
63 1
64 2
65 2
66 3
67 4
68 2
69 4
70 2
71 3
72 2
73 2
74 2
75 3
76 2
77 3
78 2
79 3
80 2
81 3
82 3
83 4
84 1
85 2
86 2
87 2

List of values

[1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 1, 2, 1, 2, 2, 2, 1, 2, 2, 1, 3, 4, 2, 3, 2, 2, 1, 2, 2, 3, 2, 3, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 3, 2, 4, 5, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 3, 1, 2, 2, 3, 4, 2, 4, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 3, 4, 1, 2, 2, 2]