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.

A005424 Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.

Table of values

n a(n)
1 2
2 3
3 4
4 5
5 8
6 9
7 13
8 16
9 17
10 24
11 25
12 35
13 44
14 63
15 64
16 91
17 97
18 128
19 193
20 221
21 259
22 324
23 353
24 391
25 477
26 702
27 929
28 1188
29 1269
30 1589
31 1613
32 2017
33 2309
34 2623
35 3397
36 4064
37 4781
38 5468
39 6515
40 6887
41 9213
42 12286
43 12887
44 14009
45 16564
46 16897
47 17803
48 30428
49 36256

List of values

[2, 3, 4, 5, 8, 9, 13, 16, 17, 24, 25, 35, 44, 63, 64, 91, 97, 128, 193, 221, 259, 324, 353, 391, 477, 702, 929, 1188, 1269, 1589, 1613, 2017, 2309, 2623, 3397, 4064, 4781, 5468, 6515, 6887, 9213, 12286, 12887, 14009, 16564, 16897, 17803, 30428, 36256]