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.

A268486 Least k starting a chain of (2n+1) consecutive integers {h(k+i)}, i=0,1,...,2n, where h(k) is the length of the finite set {k, f(k), f(f(k)), ..., 1} in the Collatz (or 3x + 1) problem, with the property that h(k) = h(k+2n), h(k+1) = h(k+2n-1), ..., h(k+n-1) = h(k+n+1).

Table of values

n a(n)
1 24
2 48
3 230
4 229
5 228
6 2987
7 7083
8 7083
9 14168
10 15959
11 57346
12 57346
13 119388
14 182852
15 365740
16 365739
17 365738
18 596310
19 596310
20 1088124
21 1088123
22 2901713
23 2901712
24 3264428
25 3264428

List of values

[24, 48, 230, 229, 228, 2987, 7083, 7083, 14168, 15959, 57346, 57346, 119388, 182852, 365740, 365739, 365738, 596310, 596310, 1088124, 1088123, 2901713, 2901712, 3264428, 3264428]