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.

A208981 Number of iterations required to reach a power of 2 in the 3x+1 sequence starting at n.

Table of values

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

List of values

[0, 0, 3, 0, 1, 4, 12, 0, 15, 2, 10, 5, 5, 13, 13, 0, 8, 16, 16, 3, 1, 11, 11, 6, 19, 6, 107, 14, 14, 14, 102, 0, 22, 9, 9, 17, 17, 17, 30, 4, 105, 2, 25, 12, 12, 12, 100, 7, 20, 20, 20, 7, 7, 108, 108, 15, 28, 15, 28, 15, 15, 103, 103, 0, 23, 23, 23, 10, 10, 10]

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

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