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.

A064916 a(n) = n/lpf(n) + lpf(n) - 1, where lpf = A020639 = least 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 7
13 13
14 8
15 7
16 9
17 17
18 10
19 19
20 11
21 9
22 12
23 23
24 13
25 9
26 14
27 11
28 15
29 29
30 16
31 31
32 17
33 13
34 18
35 11
36 19
37 37
38 20
39 15
40 21
41 41
42 22
43 43
44 23
45 17
46 24
47 47
48 25
49 13
50 26
51 19
52 27
53 53
54 28
55 15
56 29
57 21
58 30
59 59
60 31
61 61
62 32
63 23
64 33
65 17
66 34
67 67
68 35
69 25
70 36
71 71
72 37
73 73
74 38
75 27

List of values

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