Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054444
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054444 Even indexed members of A001629(n), n >= 2, (Fibonacci convolution). +0
5
1, 5, 20, 71, 235, 744, 2285, 6865, 20284, 59155, 170711, 488400, 1387225, 3916061, 10996580, 30737759, 85573315, 237387960, 656451269, 1810142185, 4978643596, 13661617195, 37409025455, 102238082976, 278920277425, 759695287349 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)= ((2*n+1)*F(2*(n+1))+4*(n+1)*F(2*n+1))/5, with F(n)= A000045(n) (Fibonacci numbers).

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

a(n)=sum(k*binom(2n-2k+2, k), k=1..n+1) - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 11 2003

CROSSREFS

Cf. A001870, A001629, A000045. a(n)= A060920(n+1, 1).

Sequence in context: A054889 A056384 A036683 this_sequence A121332 A122695 A066822

Adjacent sequences: A054441 A054442 A054443 this_sequence A054445 A054446 A054447

KEYWORD

easy,nonn

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Apr 07 2000

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research