login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025226 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 2. Also a(n) = 3^n*C(n-1), where C = A000108 (Catalan numbers). E.g. a(3)=3^3*C(2)=27*2=54. 2
3, 9, 54, 405, 3402, 30618, 288684, 2814669, 28146690, 287096238, 2975361012, 31241290626, 331638315876, 3553267670100, 38375290837080, 417331287853245, 4566095267100210 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

G.f.: (1-sqrt(1-12*x))/2 - Michael Somos, Jun 08, 2000.

Given g.f. C(x) and given A(x)= g.f. of A100239, then B(x)=A(x)-1-2x satisfies B(x)=x-C(x*B(x)). - Michael Somos Sep 07 2005

MATHEMATICA

Rest[CoefficientList[Series[(1-Sqrt[1-12x])/2, {x, 0, 20}], x]]  (* From Harvey P. Dale, Mar 09 2011 *)

PROG

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

CROSSREFS

Cf. A000108, A005159.

Sequence in context: A077795 A038496 A175596 * A001194 A032179 A175117

Adjacent sequences:  A025223 A025224 A025225 * A025227 A025228 A025229

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.