Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099571
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099571 Sum C(n-k+3,k), k=0..floor(n/2). +0
2
1, 1, 5, 6, 17, 23, 50, 73, 138, 211, 370, 581, 979, 1560, 2575, 4135, 6755, 10890, 17700, 28590, 46356, 74946, 121380, 196326, 317797, 514123, 832025, 1346148, 2178293, 3524441, 5702870, 9227311, 14930334, 24157645, 39088150, 63245795 (list; graph; listen)
OFFSET

0,3

COMMENT

Fourth column of triangle A054450.

FORMULA

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

CROSSREFS

Cf. A054451, A052952, A099572, A000045.

Sequence in context: A034454 A059013 A035595 this_sequence A041997 A041773 A041054

Adjacent sequences: A099568 A099569 A099570 this_sequence A099572 A099573 A099574

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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research