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.

A096860 Function A062401(x) = phi(sigma(x)) = f(x) is iterated. Starting with n, a(n) is the count of distinct terms arising in the transient of this trajectory, that is: a(n) = A096859(n) - A095955(n).

Table of values

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

List of values

[0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 0, 2, 1, 1, 4, 2, 3, 1, 3, 3, 1, 1, 0, 1, 3, 1, 2, 1, 1, 3, 2, 3, 1, 1, 0, 2, 2, 1, 1, 3, 1, 3, 1, 2, 2, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 3, 1, 3, 0, 4, 2, 1, 5, 3, 1, 1, 1, 3]