Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073398
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073398 Ninth convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself. +0
1
1, 20, 240, 2200, 16940, 115104, 711040, 4072640, 21930480, 112157760, 549010176, 2587777920, 11802273600, 52287866880, 225756241920, 952486588416, 3935984616960, 15961485957120, 63628396339200 (list; graph; listen)
OFFSET

0,2

COMMENT

For a(n) in terms of U(n+1) and U(n) with U(n) := A002605(n) see A073387 and the row polynomials of triangles A073405 and A073406.

FORMULA

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

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

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

CROSSREFS

Tenth (m=9) column of triangle A073387.

Sequence in context: A163004 A061139 A061121 this_sequence A040075 A138442 A140124

Adjacent sequences: A073395 A073396 A073397 this_sequence A073399 A073400 A073401

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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research