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.

A174857 The minimum distance k > 0 such that A020639(n+k) = A020639(n).

Table of values

n a(n)
2 2
3 6
4 2
5 20
6 2
7 42
8 2
9 6
10 2
11 110
12 2
13 156
14 2
15 6
16 2
17 272
18 2
19 342
20 2
21 6
22 2
23 506
24 2
25 10
26 2
27 6
28 2
29 812
30 2
31 930
32 2
33 6
34 2
35 20
36 2
37 1332
38 2
39 6
40 2
41 1640
42 2
43 1806
44 2
45 6
46 2
47 2162
48 2
49 28
50 2
51 6
52 2
53 2756
54 2
55 10
56 2
57 6
58 2
59 3422
60 2
61 3660
62 2
63 6
64 2
65 20
66 2
67 4422
68 2
69 6
70 2
71 4970
72 2
73 5256
74 2
75 6
76 2
77 14
78 2
79 6162

List of values

[2, 6, 2, 20, 2, 42, 2, 6, 2, 110, 2, 156, 2, 6, 2, 272, 2, 342, 2, 6, 2, 506, 2, 10, 2, 6, 2, 812, 2, 930, 2, 6, 2, 20, 2, 1332, 2, 6, 2, 1640, 2, 1806, 2, 6, 2, 2162, 2, 28, 2, 6, 2, 2756, 2, 10, 2, 6, 2, 3422, 2, 3660, 2, 6, 2, 20, 2, 4422, 2, 6, 2, 4970, 2, 5256, 2, 6, 2, 14, 2, 6162]