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.

A082984 Numbers k for which the 3x+1 problem takes at least k halving and tripling steps to reach 1.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 7
7 9
8 11
9 14
10 15
11 18
12 19
13 27
14 31
15 41
16 47
17 54
18 55
19 62
20 63
21 71
22 73
23 82
24 83
25 91
26 94
27 95
28 97
29 108
30 109
31 110

List of values

[1, 2, 3, 5, 6, 7, 9, 11, 14, 15, 18, 19, 27, 31, 41, 47, 54, 55, 62, 63, 71, 73, 82, 83, 91, 94, 95, 97, 108, 109, 110]