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.

A064920 a(n) = n/gpf(n) + gpf(n) - 1, where gpf = A006530 = greatest prime factor.

Table of values

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

List of values

[2, 3, 3, 5, 4, 7, 5, 5, 6, 11, 6, 13, 8, 7, 9, 17, 8, 19, 8, 9, 12, 23, 10, 9, 14, 11, 10, 29, 10, 31, 17, 13, 18, 11, 14, 37, 20, 15, 12, 41, 12, 43, 14, 13, 24, 47, 18, 13, 14, 19, 16, 53, 20, 15, 14, 21, 30, 59, 16, 61, 32, 15, 33, 17, 16, 67, 20, 25, 16, 71, 26, 73, 38, 19, 22]