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.

A135317 Let h(2*n, 1) = 2*n and h(2*n, m) = h(2*n, m-1) + 2 * d(2*n, m) for m > 1, where d(2*n, m) = (least multiple of m not less than h(2*n, m-1)) - h(2*n, m-1). Then d(2*n, m) is eventually 2-periodic as a function of m, and a(n) is defined as d(2*n, 2*m+1) for large m.

Table of values

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

List of values

[0, 1, 2, 0, 1, 2, 3, 4, 0, 3, 4, 5, 1, 2, 3, 6, 0, 1, 4, 5, 6, 2, 5, 6, 7, 8, 0, 7, 8, 9, 3, 4, 5, 1, 2, 3, 6, 7, 10, 4, 7, 8, 0, 1, 2, 9, 10, 11, 5, 8, 9, 12, 6, 7, 10, 11, 12, 8, 9, 10, 0, 3, 4, 13, 1, 2, 5, 6, 11, 3, 4, 9, 14, 0, 1, 10, 11, 12, 2, 7, 8, 13, 5, 6, 9, 12, 13, 7, 10, 11, 14, 15, 16, 14]