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.

A347179 a(1) = 1; for n > 1, a(n) = smallest distinct positive integer such that gcd(a(n),a(n-k)) = 1, where k is each divisor of a(n) and n - k >= 1.

Table of values

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

List of values

[1, 2, 3, 5, 4, 7, 9, 8, 11, 13, 10, 17, 15, 14, 19, 23, 16, 21, 25, 26, 29, 31, 22, 27, 37, 20, 41, 33, 28, 39, 43, 32, 47, 49, 34, 45, 53, 35, 58, 51, 59, 46, 61, 55, 57, 62, 65, 67, 69, 38, 71, 73, 50, 77, 79, 64, 75, 83, 44, 85, 81, 76, 87, 89, 56, 97, 63, 68, 91, 95, 74, 93, 101, 52, 103]