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.

A171870 For odd numbers x, a(x) is the number of complex numbers z in the zx + 1 problem giving the same number of iterations as the 3x + 1 problem requires to reach 1.

Table of values

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

List of values

[0, 1, 0, 4, 5, 3, 1, 4, 2, 5, 0, 3, 6, 40, 4, 38, 7, 2, 5, 10, 39, 8, 3, 37, 6, 6, 1, 40, 9, 9, 4, 38, 7, 7, 2, 36, 41, 2, 5, 10, 5, 39, 0, 8, 8, 32, 3, 37, 42, 6, 6, 30, 11, 35, 40, 23, 1, 9, 4, 9, 33, 14, 38, 14, 43, 7, 7, 12, 31, 12, 2, 36, 41, 41, 5, 2, 10, 29, 10, 17, 34, 5, 39, 22, 15, 44, 8]