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.

A322418 Least k > 0 such that A014221(k) == A014221(k+1) mod n.

Table of values

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

List of values

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