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.

A348217 a(1) = 2; for n > 1, let d be the largest divisor of n appearing in all previous terms and k the largest value such that a(k) = d, then a(n) = n - k.

Table of values

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

List of values

[2, 1, 1, 3, 2, 2, 4, 1, 5, 1, 1, 5, 2, 1, 3, 9, 3, 2, 5, 1, 4, 4, 3, 2, 6, 2, 11, 6, 9, 2, 11, 10, 2, 1, 16, 7, 3, 5, 2, 8, 7, 1, 1, 13, 16, 7, 4, 3, 3, 18, 2, 8, 10, 4, 24, 4, 8, 7, 16, 7, 18, 11, 34, 5, 21, 4, 24, 5, 20, 17, 28, 5, 30, 23, 3, 10, 15, 34, 36, 11, 52, 31, 40, 13, 15, 35, 12, 8]