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.

A225320 The number of iterations of the bi-unitary totient A116550 needed to reach 1 starting with n.

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 4
6 3
7 4
8 5
9 6
10 4
11 5
12 6
13 7
14 7
15 7
16 8
17 9
18 7
19 8
20 8
21 8
22 8
23 9
24 10
25 11
26 8
27 9
28 9
29 10
30 8
31 9
32 10
33 10
34 11
35 12
36 11
37 12
38 10
39 10
40 10
41 11
42 9
43 10
44 13
45 12
46 11
47 12
48 12
49 13
50 12
51 13
52 10
53 11
54 11
55 10
56 12
57 10
58 10
59 11
60 12
61 13
62 13
63 14
64 15
65 13
66 13
67 14
68 13
69 14
70 11
71 12
72 14
73 15
74 12
75 13
76 15
77 14
78 10
79 11
80 14

List of values

[0, 1, 2, 3, 4, 3, 4, 5, 6, 4, 5, 6, 7, 7, 7, 8, 9, 7, 8, 8, 8, 8, 9, 10, 11, 8, 9, 9, 10, 8, 9, 10, 10, 11, 12, 11, 12, 10, 10, 10, 11, 9, 10, 13, 12, 11, 12, 12, 13, 12, 13, 10, 11, 11, 10, 12, 10, 10, 11, 12, 13, 13, 14, 15, 13, 13, 14, 13, 14, 11, 12, 14, 15, 12, 13, 15, 14, 10, 11, 14]

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

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