Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118928
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118928 a(n) = Sum_{k=0..[n/2]} C(n-k,k)*C(n-k,k+1)/(n-k) * a(k), with a(0)=1. +0
1
1, 1, 1, 2, 4, 8, 17, 38, 92, 238, 643, 1790, 5076, 14573, 42241, 123484, 364052, 1082602, 3247759, 9829820, 30019326, 92517644, 287805801, 903822922, 2865339252, 9168572009, 29601077285, 96377791839, 316264456921 (list; graph; listen)
OFFSET

0,4

COMMENT

Invariant column vector V under matrix product A089732 *V = V: a(n) = Sum_{k=0,[n/2]} A089732 (n,k)*a(k), where A089732(n,k) = number of peakless Motzkin paths of length n having k (1,1) steps.

PROGRAM

(PARI) {a(n)=if(n==0, 1, sum(k=0, n\2, binomial(n-k, k)*binomial(n-k, k+1)/(n-k)*a(k)))}

CROSSREFS

Cf. A089732.

Sequence in context: A081124 A090901 A101516 this_sequence A049312 A132043 A055545

Adjacent sequences: A118925 A118926 A118927 this_sequence A118929 A118930 A118931

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), May 06 2006

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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research