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.

A329535 Numbers with twice as many halving steps before reaching 1 in the 3x + 1 problem as tripling steps.

Table of values

n a(n)
1 1
2 159
3 283
4 377
5 502
6 503
7 603
8 615
9 668
10 669
11 670
12 799
13 807
14 888
15 890
16 892
17 893
18 1063
19 1065
20 1095
21 1186
22 1187
23 1188
24 1189
25 1190
26 1417
27 1435
28 1580
29 1581
30 1582
31 1585
32 1586
33 1587
34 1889
35 1913
36 1947
37 1959
38 1963
39 2104
40 2106
41 2108
42 2109
43 2113
44 2114
45 2115
46 2119
47 2518

List of values

[1, 159, 283, 377, 502, 503, 603, 615, 668, 669, 670, 799, 807, 888, 890, 892, 893, 1063, 1065, 1095, 1186, 1187, 1188, 1189, 1190, 1417, 1435, 1580, 1581, 1582, 1585, 1586, 1587, 1889, 1913, 1947, 1959, 1963, 2104, 2106, 2108, 2109, 2113, 2114, 2115, 2119, 2518]

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

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