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.

A063574 Number of steps to reach an integer == 1 (mod 4) when iterating the map n -> 3n/2 if n even or (3n+1)/2 if n odd.

Table of values

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

List of values

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