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.

A175125 a(n) is the number of numbers m such that the number of iterations of r -> r - (largest divisor d < r) needed to reach 1 starting at r = m is equal to n.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 5
5 9
6 13
7 23
8 36
9 65
10 100
11 175
12 275
13 468
14 760
15 1266
16 2077
17 3454
18 5690
19 9449
20 15547
21 25709
22 42459
23 70181
24 115947
25 191509
26 316570
27 523087
28 864406
29 1428174
30 2359266

List of values

[1, 1, 2, 3, 5, 9, 13, 23, 36, 65, 100, 175, 275, 468, 760, 1266, 2077, 3454, 5690, 9449, 15547, 25709, 42459, 70181, 115947, 191509, 316570, 523087, 864406, 1428174, 2359266]