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.

A059447 Smallest number that takes n steps to get to 1 under the map f(n)=sigma(n)-n, the sum of the proper divisors.

Table of values

n a(n)
0 1
1 2
2 4
3 9
4 14
5 16
6 12
7 34
8 52
9 90
10 60
11 66
12 54
13 42
14 30
15 126
16 114
17 102
18 624
19 760
20 680
21 580
22 540
23 748
24 740
25 520
26 672
27 408
28 666
29 360
30 264
31 546
32 510
33 330
34 318
35 2960
36 2574
37 1782
38 1494
39 3672
40 3114
41 2790
42 1680
43 1386
44 1374
45 930
46 612
47 594
48 582
49 378
50 366
51 180
52 3570

List of values

[1, 2, 4, 9, 14, 16, 12, 34, 52, 90, 60, 66, 54, 42, 30, 126, 114, 102, 624, 760, 680, 580, 540, 748, 740, 520, 672, 408, 666, 360, 264, 546, 510, 330, 318, 2960, 2574, 1782, 1494, 3672, 3114, 2790, 1680, 1386, 1374, 930, 612, 594, 582, 378, 366, 180, 3570]