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.

A225176 Number of numbers which require n iterations of the bi-unitary totient function (A116550) to reach 1.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 3
6 2
7 2
8 4
9 7
10 6
11 13
12 12
13 16
14 24
15 31
16 51
17 66
18 87
19 126
20 139
21 187
22 260
23 331
24 412
25 551
26 693

List of values

[1, 1, 1, 2, 3, 2, 2, 4, 7, 6, 13, 12, 16, 24, 31, 51, 66, 87, 126, 139, 187, 260, 331, 412, 551, 693]