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.

A308964 Least k > 0 such that A014222(k) == A014222(k+1) (mod n).

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.