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.

A096859 Function A062401(x) = phi(sigma(x)) = f(x) is iterated. Starting with n, a(n) is the count of distinct terms arising in trajectory; a(n)=t(n)+c(n)=t+c, where t=number of transient terms, c=number of recurrent terms (in the terminal cycle).

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 3, 1, 2, 3, 3, 1, 3, 2, 2, 3, 3, 4, 2, 2, 4, 2, 2, 3, 4, 2, 4, 4, 2, 3, 4, 4, 4, 5, 4, 3, 5, 4, 4, 4, 2, 5, 3, 4, 4, 4, 4, 2, 4, 3, 4, 6, 5, 5, 4, 5, 5, 4, 4, 2, 4, 5, 3, 4, 4, 3, 5, 4, 5, 3, 4, 2, 4, 4, 3, 3, 5, 3, 5, 3, 4, 4, 4, 3, 4, 5, 5, 3, 4, 3, 3, 3, 5, 3, 5, 2, 6, 4, 3, 7, 5, 3, 3, 3, 5]