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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002067 a(n) = Sum_{k=0..n-1} binomial(2*n,2*k)*a(k)*a(n-k-1).
(Formerly M4458 N1889)
7
1, 1, 7, 127, 4369, 243649, 20036983, 2280356863, 343141433761, 65967241200001, 15773461423793767, 4591227123230945407, 1598351733247609852849, 655782249799531714375489, 313160404864973852338669783, 172201668512657346455126457343, 108026349476762041127839800617281 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Also number of increasing rooted triangular cacti of 2n+1 nodes. (In an increasing rooted graph, nodes are numbered and numbers increase as you move away from root.)

a(n) is (2n)!/2^n times the n-th coefficient in the series for InverseErf[2x/Sqrt[Pi]]. [From Paul Barry (pbarry(AT)wit.ie), Apr 12 2010]

REFERENCES

Cf. Chapter 5 of F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Camb. 1998.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=0..50

Wikipedia, Error Function

Index entries for sequences related to cacti

FORMULA

We have a(n)=b(2n+1), where e.g.f. of b satisfies B'(x)=exp(B(x)^2/2).

a(n)=(2n)!*A092676(n)/(2^n*A092677(n)). [From Paul Barry (pbarry(AT)wit.ie), Apr 12 2010]

a(n) = 1/2^n*A026944(n+1). Let D denote the operator g(x) -> 1/sqrt(2)*d/dx(exp(x^2)*g(x)). Then a(n) = D^(2*n)(1) evaluated at x = 0. - Peter Bala, Sep 08 2011

E.g.f. A(x) satisfies differential equation A''(x)-A(x)*A''(x)-1=0, A'(0)=1/2. [From Vladimir Kruchinin, Nov 18 2011]

MAPLE

a:=proc(n) option remember; if n <= 0 then RETURN(1); else RETURN( add( binomial(2*n, 2*k)*a(k)*a(n-k-1), k=0..n-1 ) ); fi; end;

CROSSREFS

The sequence of fractions A092676/A132467 is closely related.

Periods: A122149, A122159.

Sequence in context: A025166 A139291 A092676 * A138523 A034670 A020516

Adjacent sequences:  A002064 A002065 A002066 * A002068 A002069 A002070

KEYWORD

nonn,eigen,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Alternate description, formula and comment from Christian G. Bower (bowerc(AT)usa.net).

New definition and more terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 22 2005

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 15 15:20 EST 2012. Contains 205823 sequences.