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.

A099771 Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.

Table of values

n a(n)
1 25
2 95
3 417
4 675
5 2541
6 3888
7 3528
8 16256
9 13984
10 11312
11 10648
12 10688
13 6672
14 15364
15 20476
16 12288
17 12636
18 32216
19 33304
20 33896
21 34504
22 38660
23 31824
24 15792
25 62296
26 67304
27 49120
28 58104
29 102740
30 82120
31 84704
32 53680

List of values

[25, 95, 417, 675, 2541, 3888, 3528, 16256, 13984, 11312, 10648, 10688, 6672, 15364, 20476, 12288, 12636, 32216, 33304, 33896, 34504, 38660, 31824, 15792, 62296, 67304, 49120, 58104, 102740, 82120, 84704, 53680]