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.

A386885 a(n) is the number of iterations that -n requires to reach 1 under the map x -> -x/2 if x is even, 3x + 1 if x is odd.

Table of values

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

List of values

[2, 1, 4, 4, 10, 13, 13, 3, 16, 6, 6, 6, 45, 9, 9, 6, 48, 12, 12, 12, 25, 51, 51, 15, 15, 15, 15, 15, 41, 54, 54, 5, 18, 18, 18, 18, 31, 44, 44, 8, 57, 8, 8, 8, 21, 21, 21, 8, 34, 47, 47, 47, 60, 60, 60, 11, 11, 11, 11, 11, 86, 24, 24, 8, 37, 50, 50, 50, 50, 63]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.