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.

A071912 a(0) = 0, a(1) = 1; to get a(n+1) for n >= 1, let m = a(n) and consider in turn the numbers k = m-1, m-2, ..., 2, 1, m+1, m+2, m+3, ... until reach a k such that gcd(m,k) = 1 and m/k is different from all a(i)/a(i+1) for i = 0, ..., n-1.

Table of values

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

List of values

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