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.

A375494 a(n) = minimum number of operations chosen from f(x) = 3x+1 and g(x) = floor(x/2) needed to reach n when starting from 1.

Table of values

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

List of values

[1, 0, 2, 4, 1, 6, 3, 3, 8, 5, 5, 5, 10, 2, 7, 7, 7, 7, 12, 4, 4, 9, 4, 9, 9, 9, 9, 14, 6, 6, 6, 6, 11, 6, 6, 11, 11, 11, 11, 11, 3, 16, 8, 8, 8, 8, 8, 8, 13, 8, 8, 8, 8, 13, 13, 13, 13, 13, 5, 13, 5, 5, 18, 10, 10, 10, 10, 5, 10, 10, 10, 10, 15, 10, 10, 10, 10, 10, 10, 10]