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.

A346965 a(n) is the number of ascending subsequences in reducing n to 1 using the Collatz reduction, or -1 if n refutes the Collatz conjecture.

Table of values

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

List of values

[0, 0, 1, 0, 1, 1, 3, 0, 4, 1, 3, 1, 2, 3, 2, 0, 3, 4, 4, 1, 1, 3, 2, 1, 5, 2, 17, 3, 4, 2, 16, 0, 6, 3, 2, 4, 4, 4, 6, 1, 17, 1, 6, 3, 4, 2, 16, 1, 5, 5, 5, 2, 2, 17, 17, 3, 7, 4, 6, 2, 3, 16, 15, 0, 6, 6, 5, 3, 3, 2, 16, 4, 18, 4, 2, 4, 5, 6, 6, 1, 4, 17, 17]