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.

A225175 Largest number which requires n iterations of the bi-unitary totient function (A116550) to reach 1.

Table of values

n a(n)
0 1
1 2
2 3
3 6
4 10
5 11
6 12
7 18
8 30
9 42
10 78
11 106
12 210
13 366
14 550
15 603
16 750
17 1290
18 2562
19 4398
20 4305
21 7470
22 9090
23 14322
24 24558
25 35382
26 55482
27 78020
28 141190
29 207519
30 301642
31 429870
32 552693
33 684846
34 1060710
35 1391390
36 2385246
37 3454044

List of values

[1, 2, 3, 6, 10, 11, 12, 18, 30, 42, 78, 106, 210, 366, 550, 603, 750, 1290, 2562, 4398, 4305, 7470, 9090, 14322, 24558, 35382, 55482, 78020, 141190, 207519, 301642, 429870, 552693, 684846, 1060710, 1391390, 2385246, 3454044]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.