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.
%I A185454 #24 Dec 12 2023 07:45:18 %S A185454 5,13,33,83,208,104,52,26,13,33,83,208,104,52,26,13,33,83,208,104,52, %T A185454 26,13,33,83,208,104,52,26,13,33,83,208,104,52,26,13,33,83,208,104,52, %U A185454 26,13,33,83,208,104,52,26,13,33,83,208,104,52,26,13,33,83,208,104,52,26,13,33,83,208,104,52,26,13,33,83,208,104,52 %N A185454 Trajectory of 5 under repeated application of the map in A185452. %C A185454 Periodic with period length 7. %D A185454 J. C. Lagarias, ed., The Ultimate Challenge: The 3x+1 Problem, Amer. Math. Soc., 2010; see page 88. %H A185454 Colin Barker, <a href="/A185454/b185454.txt">Table of n, a(n) for n = 1..1000</a> %H A185454 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a> %H A185454 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,1). %F A185454 From _Colin Barker_, Feb 01 2018: (Start) %F A185454 G.f.: x*(5 + 13*x + 33*x^2 + 83*x^3 + 208*x^4 + 104*x^5 + 52*x^6 + 21*x^7) / ((1 - x)*(1 + x + x^2 + x^3 + x^4 + x^5 + x^6)). %F A185454 a(n) = a(n-7) for n>8. (End) %p A185454 f:=n->if n mod 2 = 0 then n/2 else (5*n+1)/2; fi; %p A185454 T:=proc(n,M) global f; local t1,i; t1:=[n]; %p A185454 for i from 1 to M-1 do t1:=[op(t1),f(t1[nops(t1)])]; od: t1; end; %p A185454 T(5,120); %o A185454 (PARI) Vec(x*(5 + 13*x + 33*x^2 + 83*x^3 + 208*x^4 + 104*x^5 + 52*x^6 + 21*x^7) / ((1 - x)*(1 + x + x^2 + x^3 + x^4 + x^5 + x^6)) + O(x^60)) \\ _Colin Barker_, Feb 01 2018 %Y A185454 Cf. A185452, A185453, A185455. %K A185454 nonn,easy %O A185454 1,1 %A A185454 _N. J. A. Sloane_, Feb 04 2011 %E A185454 Comment corrected by _Paolo P. Lava_, Mar 10 2011