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.

A270570 Largest number in the sequence for the Collatz problem (excluding the original number) when started at n.

Table of values

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

List of values

[1, 16, 2, 16, 16, 52, 4, 52, 16, 52, 16, 40, 52, 160, 8, 52, 52, 88, 16, 64, 52, 160, 16, 88, 40, 9232, 52, 88, 160, 9232, 16, 100, 52, 160, 52, 112, 88, 304, 20, 9232, 64, 196, 52, 136, 160, 9232, 24, 148, 88, 232, 40, 160, 9232, 9232, 52, 196, 88, 304, 160]