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.

A224533 Odd numbers n for which the number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n.

Table of values

n a(n)
1 1
2 335
3 1249
4 2013
5 6557
6 6801
7 6803
8 7501
9 7505
10 10219
11 22633
12 25183
13 27075
14 31839
15 36633
16 36691
17 40985
18 45013
19 45027
20 45041
21 59365
22 61601
23 64577
24 64579
25 75179
26 75507
27 77267
28 86015
29 88465
30 88473
31 97059
32 97061
33 97069
34 97073
35 97075
36 97261
37 107903
38 108545

List of values

[1, 335, 1249, 2013, 6557, 6801, 6803, 7501, 7505, 10219, 22633, 25183, 27075, 31839, 36633, 36691, 40985, 45013, 45027, 45041, 59365, 61601, 64577, 64579, 75179, 75507, 77267, 86015, 88465, 88473, 97059, 97061, 97069, 97073, 97075, 97261, 107903, 108545]