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.

A053046 a(n) is the number of terms that are not powers of 2 among the iterates of the Euler phi function when it is iterated with initial value n!.

Table of values

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

List of values

[0, 0, 1, 1, 1, 2, 3, 3, 5, 5, 5, 6, 7, 8, 9, 9, 9, 11, 13, 13, 15, 15, 15, 16, 16, 17, 20, 21, 22, 23, 24, 24, 25, 25, 26, 28, 30, 32, 34, 34, 34, 36, 38, 38, 40, 40, 40, 41, 43, 43, 44, 45, 46, 49, 49, 50, 53, 54, 55, 56, 57, 58, 61, 61, 62, 63, 64, 64, 65, 66, 67, 69, 71, 73, 74]