login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097334 Sum k=0..n, C(n-k, floor(k/2))2^k. 4

%I #11 May 17 2021 11:46:00

%S 1,3,3,7,19,31,59,135,259,495,1035,2071,4051,8191,16475,32679,65443,

%T 131343,262059,523831,1049203,2097439,4192763,8389575,16779331,

%U 33550383,67108683,134226007,268427539,536862271,1073766299,2147476455

%N Sum k=0..n, C(n-k, floor(k/2))2^k.

%H Harvey P. Dale, <a href="/A097334/b097334.txt">Table of n, a(n) for n = 0..1000</a>

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

%F G.f. : (1+2x)/((1-2*x)*(1+x+2*x^2)); a(n)=a(n-1)+4a(n-3).

%t Table[Sum[Binomial[n-k,Floor[k/2]]2^k,{k,0,n}],{n,0,40}] (* or *) LinearRecurrence[{1,0,4},{1,3,3},40] (* _Harvey P. Dale_, May 17 2021 *)

%Y Cf. A089977, A097333, A097335.

%K easy,nonn

%O 0,2

%A _Paul Barry_, Aug 05 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 13:51 EDT 2024. Contains 371914 sequences. (Running on oeis4.)