OFFSET
1,1
COMMENTS
a(1) = A078441(5).
Or numbers k such that h(k) + h(k+4) = h(k+1) + h(k+3) and h(k+2) = (h(k) + h(k+4))/2, where h(k) is the length of k, f(k), f(f(k)), ..., 1 in the Collatz (or 3x + 1) problem.
The 5-tuple of consecutive h(k) are symmetric about the central value h(k+2) which are averages of both their immediate neighbors and their second neighbors.
A majority of numbers generate trivial 5-tuples {m, m, m, m, m}.
The 5-tuples {h(k)} of the form {m, p, p, p, q} are generated by the numbers of the sequence 507, 1003, ...
The 5-tuples {h(k)} of the form {m, p, m, q, m} are generated by the numbers of the sequence 1272, 3672, ...
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1560
EXAMPLE
In 5-tuple of consecutive {h(k)}: {h(1272),h(1273),h(1274),h(1275),h(1276)} = {57,31,57,83,57}, the central value is 57, and 57+57 = 31+83 = 2*57. Hence, 1272 is in the sequence.
Alternatively, the symmetry can be seen from the differences between consecutive {h(k)}. For {57,31,57,83,57}, the differences {h(k+1)-h(k)} are {-26,26,26,-26}.
MATHEMATICA
lst={}; f[n_]:=Module[{a=n, k=0}, While[a!=1, k++; If[EvenQ[a], a=a/2, a=a*3+1]]; k]; Do[If[f[m]+f[m+4]==f[m+1]+f[m+3]&&f[m+2]==(f[m]+f[m+4])/2, AppendTo[lst, m]], {m, 1, 4000}]; lst
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jan 29 2016
STATUS
approved