Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073397
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073397 Eighth convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself. +0
3
1, 18, 198, 1680, 12060, 76824, 446952, 2420352, 12363120, 60151520, 280833696, 1265442048, 5528697408, 23507763840, 97575960960, 396398370816, 1579498956288, 6184543546368, 23833455191040 (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) := A073394(k).

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

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

CROSSREFS

Ninth (m=8) column of triangle A073387.

Sequence in context: A042940 A034727 A060532 this_sequence A020920 A083812 A086573

Adjacent sequences: A073394 A073395 A073396 this_sequence A073398 A073399 A073400

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 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research