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.

A280929 Number of steps required to reach the first prime when starting from n in the Collatz (or '3x+1') problem.

Table of values

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

List of values

[2, 3, 2, 1, 4, 1, 2, 2, 3, 1, 2, 2, 4, 1, 2, 3, 3, 4, 2, 2, 6, 1, 4, 3, 3, 1, 2, 2, 4, 3, 2, 4, 6, 1, 2, 5, 5, 1, 2, 3, 3, 7, 8, 2, 4, 1, 2, 4, 3, 4, 6, 2, 6, 3, 2, 3, 3, 1, 2, 4, 4, 1, 17, 5, 6, 7, 2, 2, 5, 3, 2, 6, 5, 1, 2, 2, 4, 3, 4, 4, 3, 1, 6, 8, 8, 1, 2, 3, 3, 5, 2, 2, 6, 1, 15, 5, 3, 4, 2, 5]