A094329 - OEIS

A094329

Iterate the map in A006369 starting at 16.

16, 21, 14, 19, 25, 33, 22, 29, 39, 26, 35, 47, 63, 42, 28, 37, 49, 65, 87, 58, 77, 103, 137, 183, 122, 163, 217, 289, 385, 513, 342, 228, 152, 203, 271, 361, 481, 641, 855, 570, 380, 507, 338, 451, 601, 801, 534, 356, 475, 633, 422, 563, 751, 1001, 1335, 890, 1187, 1583

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

REFERENCES

J. C. Lagarias, ed., The Ultimate Challenge: The 3x+1 Problem, Amer. Math. Soc., 2010; see page 270.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1001

Index entries for sequences related to 3x+1 (or Collatz) problem

MATHEMATICA

SubstitutionSystem[{n_ :> Switch[Mod[n, 3], 0, 2n/3, 1, (4n - 1)/3, _, (4n + 1)/3]}, {16}, 60] // Flatten (* Jean-François Alcover, Mar 01 2019 *)

PROG

(Haskell)