Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073388
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073388 Convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself. +0
5
1, 4, 16, 56, 188, 608, 1920, 5952, 18192, 54976, 164608, 489088, 1443776, 4238336, 12382208, 36022272, 104407296, 301618176, 868765696, 2495715328, 7152286720, 20452548608, 58369409024 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=sum(b(k)*b(n-k), k=0..n) with b(k) := A002605(k).

a(n)=(2^n)*sum(binomial(n-k+1, 1)*binomial(n-k, k)*(1/2)^k, k=0..floor(n/2)).

a(n)= ((n+1)*U(n+1)+2*(n+2)*U(n))/6, with U(n) := A002605(n), n>=0.

G.f.: 1/(1-2*x*(1+x))^2.

a(n)=sum{k=0..floor((n+2)/2), k*binomial(n-k+2, k)2^(n-k+1)} - Paul Barry (pbarry(AT)wit.ie), Oct 15 2004

CROSSREFS

Second (m=1) column of triangle A073387.

Sequence in context: A127634 A115108 A127393 this_sequence A109634 A026126 A026155

Adjacent sequences: A073385 A073386 A073387 this_sequence A073389 A073390 A073391

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Aug 2, 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research