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.

A094450 Number of iterations of the sum of digits of the divisors of 10^n needed to reach 15.

Table of values

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

List of values

[12, 10, 16, 15, 3, 11, 4, 13, 6, 6, 5, 19, 16, 3, 11, 13, 19, 7, 5, 9, 6, 16, 16, 19, 5, 3, 12, 3, 18, 16, 4, 10, 6, 16, 18, 12, 4, 16, 12, 13, 12, 5, 12, 5, 20, 15, 16, 12, 4, 16, 4, 20, 5, 19, 4, 6, 21, 5, 6, 5, 21, 12, 5, 16, 13, 17, 6, 5, 7, 21, 20, 18, 12, 10, 6, 18, 13, 13, 6, 13, 15]