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.

A094501 Smallest number that requires n iterations of the sum of digits of the divisors (A034690) to reach 15.

Table of values

n a(n)
0 15
1 8
2 7
3 4
4 3
5 2
6 19
7 12
8 6
9 5
10 13
11 9
12 10
13 16
14 30
15 18
16 34
17 36
18 66
19 162
20 924
21 71820
22 127005777360

List of values

[15, 8, 7, 4, 3, 2, 19, 12, 6, 5, 13, 9, 10, 16, 30, 18, 34, 36, 66, 162, 924, 71820, 127005777360]