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.

A348007 Starting value of the longest run of halving steps in the trajectory from n to 1 in the Collatz map (or 3x+1 problem), or -1 if no such trajectory exists.

Table of values

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

List of values

[2, 16, 4, 16, 16, 16, 8, 16, 16, 16, 16, 16, 16, 160, 16, 16, 16, 16, 16, 64, 16, 160, 16, 16, 16, 160, 16, 16, 160, 160, 32, 16, 16, 160, 16, 112, 16, 304, 16, 160, 64, 112, 16, 16, 160, 160, 48, 112, 16, 16, 16, 160, 160, 160, 16, 112, 16, 304, 160, 160, 160]

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

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