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!)
A245560 Row sums of triangle in A144480. 1

%I

%S 1,2,6,14,36,82,196,436,1000,2186,4884,10540,23128,49428,107048,

%T 227048,486864,1026394,2183860,4581244,9686776,20237372,42571896,

%U 88632664,185653936,385380932,804316296,1665340856,3464899440,7158117736,14853106384

%N Row sums of triangle in A144480.

%F From _N. J. A. Sloane_, Aug 07 2014: if n is even, a(n) = (n+2)*2^(n-1)-(n/2)*binomial(n,n/2) otherwise a(n) = (n+2)*2^(n-1)-((n+1)/4)*binomial(n+1,(n+1)/2). This follows easily from the definition.

%p f:=n->if (n mod 2) = 0 then (n+2)*2^(n-1)-(n/2)*binomial(n,n/2)

%p else (n+2)*2^(n-1)-((n+1)/4)*binomial(n+1,(n+1)/2); fi;

%p [seq(f(n),n=0..40)];

%Y Cf. A144480.

%K nonn,easy

%O 0,2

%A _Roger L. Bagula_, Oct 11 2008

%E Edited with more terms by _N. J. A. Sloane_, Aug 07 2014

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 August 7 19:55 EDT 2022. Contains 355994 sequences. (Running on oeis4.)