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.

A171490 Numbers for which the smallest number of steps to reach 1 in "3x+1" (or Collatz) problem is a prime.

Table of values

n a(n)
1 1
2 5
3 7
4 12
5 14
6 16
7 29
8 51
9 56
10 58
11 60
12 64
13 65
14 67
15 74
16 75
17 78
18 83
19 87
20 90
21 100
22 102
23 104
24 106
25 109
26 115
27 118
28 119
29 122
30 128
31 130
32 132
33 134
34 141
35 142
36 147
37 161
38 166
39 173
40 176
41 187
42 188
43 200
44 212
45 219
46 221
47 231
48 234
49 239
50 241
51 251
52 259
53 264
54 293
55 313
56 314
57 316

List of values

[1, 5, 7, 12, 14, 16, 29, 51, 56, 58, 60, 64, 65, 67, 74, 75, 78, 83, 87, 90, 100, 102, 104, 106, 109, 115, 118, 119, 122, 128, 130, 132, 134, 141, 142, 147, 161, 166, 173, 176, 187, 188, 200, 212, 219, 221, 231, 234, 239, 241, 251, 259, 264, 293, 313, 314, 316]

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

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