Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099572
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099572 Sum C(n-k+4,k), k=0..floor(n/2). +0
2
1, 1, 6, 7, 23, 30, 73, 103, 211, 314, 581, 895, 1560, 2455, 4135, 6590, 10890, 17480, 28590, 46070, 74946, 121016, 196326, 317342, 514123, 831465, 1346148, 2177613, 3524441, 5702054, 9227311, 14929365, 24157645, 39087010, 63245795, 102332805 (list; graph; listen)
OFFSET

0,3

COMMENT

Fifth column of triangle A054450. In general sum{k=0..floor(n/2), binomial(n-k+r,k)}, r>=0, will have g.f. 1/((1-x)^r(1-x-x^2)) and for r>0, a(n)=sum{k=0..n, F(n-k+1)*binomial(k/2+r-1,r-1)(1+(-1)^k)/2}.

FORMULA

G.f.: 1/((1-x)^4(1-x-x^2)); a(n)=sum{k=0..n, F(n-k+1)*binomial(k/2+3, 3)(1+(-1)^k)/2}.

CROSSREFS

Cf. A054451, A052952, A099571, A000045.

Sequence in context: A062369 A048062 A081284 this_sequence A110928 A067151 A135987

Adjacent sequences: A099569 A099570 A099571 this_sequence A099573 A099574 A099575

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Oct 23 2004

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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research