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.

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

List of values

[1, 1, 1, 2, 1, 4, 1, 1, 6, 1, 3, 1, 14, 1, 2, 5, 5, 1, 28, 1, 1, 4, 1, 9, 5, 9, 1, 48, 1, 1, 2, 3, 10, 1, 1, 15, 5, 23, 12, 2, 1, 131, 1, 3, 1, 4, 6, 3, 20, 5, 2, 1, 1, 27, 5, 43, 34, 25, 1, 4, 1, 1, 332, 1, 5, 5, 2, 1, 10, 8, 12, 3, 37, 5, 5, 4, 10, 2, 1, 1, 39, 5, 63, 68, 67]