Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073389
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073389 Second convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself. +0
6
1, 6, 30, 128, 504, 1872, 6672, 23040, 77616, 256288, 832416, 2666496, 8441600, 26454528, 82174464, 253280256, 775316736, 2358812160, 7137023488, 21487386624, 64401106944, 192229535744, 571630694400 (list; graph; listen)
OFFSET

0,2

FORMULA

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

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

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

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

CROSSREFS

Third (m=2) column of triangle A073387, A073388.

Sequence in context: A131458 A032205 A007465 this_sequence A036068 A081895 A030280

Adjacent sequences: A073386 A073387 A073388 this_sequence A073390 A073391 A073392

KEYWORD

nonn,easy

AUTHOR

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

page 1

Search completed in 0.007 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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research