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.

A248737 a(0) = 0; a(n) = smallest k such that gcd(a(n-k), n) is not 1.

Table of values

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

List of values

[0, 1, 2, 3, 2, 5, 2, 7, 2, 6, 1, 11, 3, 13, 5, 1, 7, 17, 6, 19, 2, 3, 2, 23, 2, 11, 2, 6, 1, 29, 3, 31, 5, 3, 7, 1, 3, 37, 11, 3, 8, 41, 2, 43, 2, 6, 1, 47, 3, 15, 1, 2, 1, 53, 3, 6, 1, 2, 1, 59, 3, 61, 5, 3, 7, 3, 1, 67, 11, 4, 1, 71, 3, 73, 5, 1, 7, 1, 6, 79]