OFFSET
0,2
REFERENCES
J. C. Lagarias, ed., The Ultimate Challenge: The 3x+1 Problem, Amer. Math. Soc., 2010; see pages 11, 88.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (0,2,0,-1).
FORMULA
a(n) = (6*n+1-(4*n+1)*(-1)^n)/4; g.f.: x*(3+x+2*x^2)/(1-x^2)^2; a(n) = 2*a(n-2)-a(n-4) for n>3. [Bruno Berselli, Feb 09 2011]
MAPLE
f:=n->if n mod 2 = 0 then n/2 else (5*n+1)/2; fi;
MATHEMATICA
LinearRecurrence[{0, 2, 0, -1}, {0, 3, 1, 8}, 80] (* Harvey P. Dale, May 16 2014 *)
If[EvenQ[#], #/2, (5#+1)/2]&/@Range[0, 80] (* Harvey P. Dale, Jan 02 2015 *)
PROG
(Magma) [ IsEven(n) select n/2 else (5*n+1)/2: n in [0..79] ]; // Bruno Berselli, Feb 09 2011
(PARI) a(n)=if(n%2, 5*n+1, n)/2 \\ Charles R Greathouse IV, Sep 02 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Feb 04 2011
STATUS
approved