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.

A097028 Function f(x) = EulerPhi(x) + floor(x/2) is iterated; a(n) is the length of transient part and terminal cycle if the iteration was initiated at n. So a(n) is the number of distinct terms arising during iteration.

Table of values

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

List of values

[1, 1, 1, 1, 2, 2, 3, 1, 2, 2, 2, 3, 3, 4, 1, 1, 5, 2, 5, 3, 2, 2, 4, 4, 2, 3, 4, 4, 6, 4, 3, 1, 4, 5, 5, 4, 4, 5, 23, 5, 4, 5, 22, 6, 2, 2, 24, 6, 25, 3, 3, 4, 23, 3, 21, 5, 2, 3, 21, 3, 25, 26, 21, 1, 6, 24, 20, 25, 23, 22, 27, 4, 26, 27, 36, 28, 35, 22, 33, 5, 30, 31, 20, 25, 28, 29, 20, 26, 29]