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.

A075680 For odd numbers 2n-1, the minimum number of iterations of the reduced Collatz function R required to yield 1. The function R is defined as R(k) = (3k+1)/2^r, with r as large as possible.

Table of values

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

List of values

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