Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118929
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118929 a(n) = Sum_{k=0..[n/2]} 2^(n-2*k-1)*C(n-1,2*k)*C(2*k,k)/(k+1)*a(k), with a(0)=1. +0
1
1, 1, 2, 5, 14, 44, 152, 569, 2270, 9524, 41576, 187432, 868144, 4117216, 19945408, 98523013, 495521686, 2534420852, 13167361256, 69417635240, 370991119792, 2008036459744, 10997771773888, 60896581502800, 340633178891872 (list; graph; listen)
OFFSET

0,3

COMMENT

Invariant column vector V under matrix product A091894*V = V: a(n) = Sum_{k=0,[n/2]} A091894(n,k)*a(k), where A091894(n,k) = number of Dyck paths of semilength n, having k ddu's [here u=(1,1) and d=(1,-1)].

PROGRAM

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

CROSSREFS

Cf. A091894.

Sequence in context: A137557 A119021 A002890 this_sequence A081558 A014322 A095148

Adjacent sequences: A118926 A118927 A118928 this_sequence A118930 A118931 A118932

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research