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.

A373092 The number of iterations of the map x -> A093653(x) that are required to reach from n to one of the fixed points, 1, 2, 3 or 6.

Table of values

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

List of values

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

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

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