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.

A078929 Least k > 0 such that A000002(n+k) = A000002(n).

Table of values

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

List of values

[3, 1, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 3, 1, 2, 2, 3, 1, 2, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 3, 1, 3, 1, 2, 3, 1, 3, 1, 2, 2, 3, 1, 2, 2]