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.

A053096 When the Euler phi function is iterated with initial value A002110(n) = primorial, a(n) = number of iterations required to reach the fixed number = 1.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 9
6 12
7 16
8 19
9 23
10 27
11 31
12 35
13 40
14 44
15 49
16 54
17 59
18 64
19 69
20 74
21 79
22 84
23 90
24 96
25 102
26 108
27 114
28 120
29 125
30 131
31 136
32 142
33 149
34 155
35 161
36 167
37 173
38 178
39 185
40 191
41 198
42 204
43 210
44 217
45 223
46 229
47 235
48 241
49 248
50 254
51 261
52 268
53 275
54 282
55 290
56 297
57 304
58 310

List of values

[1, 2, 4, 6, 9, 12, 16, 19, 23, 27, 31, 35, 40, 44, 49, 54, 59, 64, 69, 74, 79, 84, 90, 96, 102, 108, 114, 120, 125, 131, 136, 142, 149, 155, 161, 167, 173, 178, 185, 191, 198, 204, 210, 217, 223, 229, 235, 241, 248, 254, 261, 268, 275, 282, 290, 297, 304, 310]

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

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