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.

A175127 a(n) = the largest numbers m with the number of steps n of iterations of {r - (smallest prime divisor of r)} needed to reach 0 starting at r = m .

Table of values

n a(n)
2 4
3 6
4 9
5 10
6 12
7 15
8 16
9 18
10 21
11 25
12 24
13 27
14 28
15 30
16 35
17 34
18 36
19 39
20 40
21 42
22 49
23 46
24 48
25 51
26 55
27 54
28 57
29 58
30 60
31 65
32 64
33 66
34 69
35 70
36 77
37 75
38 76
39 78
40 81
41 85
42 84
43 91
44 88
45 90
46 95
47 94
48 96
49 99
50 100
51 102
52 105
53 106
54 108
55 111
56 121
57 119
58 117
59 118
60 120
61 125
62 124
63 126
64 133
65 130
66 132

List of values

[4, 6, 9, 10, 12, 15, 16, 18, 21, 25, 24, 27, 28, 30, 35, 34, 36, 39, 40, 42, 49, 46, 48, 51, 55, 54, 57, 58, 60, 65, 64, 66, 69, 70, 77, 75, 76, 78, 81, 85, 84, 91, 88, 90, 95, 94, 96, 99, 100, 102, 105, 106, 108, 111, 121, 119, 117, 118, 120, 125, 124, 126, 133, 130, 132]