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!)
A102591 a(n) = Sum_{k=0..n} binomial(2n+1, 2k)*3^(n-k). 10
1, 6, 44, 328, 2448, 18272, 136384, 1017984, 7598336, 56714752, 423324672, 3159738368, 23584608256, 176037912576, 1313964867584, 9807567290368, 73204678852608, 546407161659392, 4078438577864704, 30441879976280064 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
In general, Sum_{k=0..n} binomial(2n+1,2k)*r^(n-k) has g.f. (1-(r-1)x)/(1-2(r+1)+(r-1)^2x^2) and a(n) = ((sqrt(r)-1)^(2n+1) + (sqrt(r)+1)^(2n+1))/(2*sqrt(r)).
LINKS
FORMULA
G.f.: (1-2x)/(1-8x+4x^2);
a(n) = 8*a(n-1) - 4*a(n-2);
a(n) = sqrt(3)*(sqrt(3)-1)^(2n+1)/6 + sqrt(3)*(sqrt(3)+1)^(2n+1)/6.
a(n) = 2^n*A079935(n). - R. J. Mathar, Sep 20 2012
a(n) = 2^(2*n+1)*Sum_{k >= n} binomial(2*k,2*n)*(1/3)^(k+1). Cf. A099156. - Peter Bala, Nov 29 2021
3*a(n)^2 = A107903(n)^2 + 2^(2*n+1). - Philippe Deléham, Mar 21 2023
MATHEMATICA
LinearRecurrence[{8, -4}, {1, 6}, 20] (* Harvey P. Dale, Sep 28 2021 *)
CROSSREFS
Bisection of A080879 or A002605.
Sequence in context: A091163 A189800 A227665 * A114935 A115969 A082412
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Jan 22 2005
STATUS
approved

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 28 19:40 EDT 2024. Contains 372092 sequences. (Running on oeis4.)