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.

A086793 Number of iterations of the map A034690 (x -> sum of digits of all divisors of x) required to reach one of the fixed points, 15 or 1.

Table of values

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

List of values

[0, 5, 4, 3, 9, 8, 2, 1, 11, 12, 5, 7, 10, 1, 0, 13, 12, 15, 6, 1, 2, 12, 9, 9, 11, 1, 13, 9, 8, 14, 10, 14, 8, 16, 3, 17, 6, 10, 2, 14, 9, 9, 2, 3, 9, 16, 8, 3, 3, 3, 16, 2, 12, 4, 16, 4, 2, 14, 1, 10, 2, 1, 15, 7, 3, 18, 2, 18, 10, 18, 12, 11, 6, 10, 17, 10, 10, 17, 13, 10, 11, 16, 8, 2, 14, 10, 15]