Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025227
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025227 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 3. +0
15
0, 1, 2, 4, 12, 40, 144, 544, 2128, 8544, 35008, 145792, 615296, 2625792, 11311616, 49124352, 214838528, 945350144, 4182412288, 18593224704, 83015133184, 372090122240, 1673660915712, 7552262979584, 34178799378432, 155096251351040, 705533929816064 (list; graph; listen)
OFFSET

0,3

COMMENT

Series reversion of g.f. A(x) is -A(-x). - Michael Somos, Jul 27 2003

a(n) = number of royal paths (A006318) from (0,0) to (n-1,n-1) such that every northeast (diagonal) step is either immediately followed by a north step or ends the path. For example a(3)=4 counts EDN, EENN, END, ENEN (E=east,D=diagonal,N=north). - David Callan (callan(AT)stat.wisc.edu), Jul 03 2006

Comments from David Callan (callan(AT)stat.wisc.edu), Sep 25 2006: a(n) = # ordered trees with n leaves in which (i) every node (= non-root non-leaf vertex) has at least 2 children, and (ii) each leaf is either the leftmost or rightmost child of its parent. For example, a(3)=4 counts

......|

./\.../ \

./\..../\

and their mirror images.

REFERENCES

D. Merlini, D. G. Rogers, R. Sprugnoli and M. C. Verri, On some alternative characterizations of Riordan arrays, Canad. J. Math., 49 (1997), 301-320.

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 655

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 657

D. Merlini, D. G. Rogers, R. Sprugnoli and M. C. Verri, On some alternative characterizations of Riordan arrays, Canad. J. Math., 49 (1997), 301-320.

FORMULA

a(n)=sum(C(n-k-1)*binomial(n-k, k), k=0..floor(n/2)), where C(q)=binomial(2q, q)/(q+1) are the Catalan numbers (A000108). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 14 2001

na(n)=(4n-6)a(n-1)+(4n-12)a(n-2), n>2. a(1)=1, a(2)=2.

G.f. satisfies A(x)-A(x)^2 = x+x^2. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jun 30 2003

a(n)=sum{k=0..n-1, C(k)C(k+1, n-k-1)} - Paul Barry (pbarry(AT)wit.ie), Feb 23 2005

G.f. A(x) satisfies A(x)=x+C(2x*A(x)) where C(x) is g.f. of Catalan numbers A000108 offset 1. - Michael Somos Sep 08 2005

G.f.: (1-sqrt(1-4x-4x^2))/2 = 2(x+x^2)/(1+sqrt(1-4x-4x^2)). - Michael Somos, Jun 08 2000

PROGRAM

(PARI) a(n)=polcoeff((1-sqrt(1-4*x-4*x^2+x*O(x^n)))/2, n)

CROSSREFS

a(n)=A052709(n)+A052709(n-1).

A100238(n)=-(-1)^n*a(n), if n>1.

Sequence in context: A113179 A056236 A028329 this_sequence A119430 A074034 A062962

Adjacent sequences: A025224 A025225 A025226 this_sequence A025228 A025229 A025230

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research