The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A117616 a(0)=0, a(n)=4a(n-1)+2 for n odd, a(n)=4a(n-1) for n even. 2

%I

%S 0,2,8,34,136,546,2184,8738,34952,139810,559240,2236962,8947848,

%T 35791394,143165576,572662306,2290649224,9162596898,36650387592,

%U 146601550370,586406201480,2345624805922,9382499223688,37529996894754

%N a(0)=0, a(n)=4a(n-1)+2 for n odd, a(n)=4a(n-1) for n even.

%D L. Rosenfeld, Nuclear Forces, section II, Interscience, New York, 1948, p 202

%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (4,1,-4).

%F a(n) = (-5-3*(-1)^n+2^(3+2*n))/15. a(n) = 4*a(n-1)+a(n-2)-4*a(n-3). G.f.: 2*x / ((x-1)*(x+1)*(4*x-1)). [_Colin Barker_, Feb 17 2013]

%F a(n) = 2*A033114(n). - _R. J. Mathar_, Feb 27 2019

%p a:=proc(n) if n=0 then 0 elif n mod 2 = 1 then 4*a(n-1)+2 else 4*a(n-1) fi end: seq(a(n),n=0..23);

%t b[0] := 0 b[1] := 2 b[n_?EvenQ] := b[n] = 4*b[n - 1] b[n_?OddQ] := b[n] = 4*b[n - 1] + 2 a = Table[b[n], {n, 0, 25}]

%K nonn,easy

%O 0,2

%A _Roger L. Bagula_, Apr 07 2006

%E Edited by _N. J. A. Sloane_, Apr 16 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 28 10:02 EST 2020. Contains 331319 sequences. (Running on oeis4.)