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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052887 A simple grammar. 1
1, 0, 2, 12, 84, 720, 7320, 85680, 1130640, 16571520, 266747040, 4673592000, 88476252480, 1798674958080, 39061703640960, 902110060051200, 22068313153286400, 569874634276147200, 15486794507222438400 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Categorize your books by the branch of mathematics that they concern (there may be any number of these).  Within each category seperate the books you understand from the ones that you don't (there must be at least one book you understand and one that you don't). Linearly order both seperations of books in every category. - Geoffrey Critzer, Dec 11 2011

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 860

FORMULA

E.g.f.: exp(x^2/(-1+x)^2)

Recurrence: {a(1)=0, a(0)=1, a(2)=2, (-n^3-2*n-3*n^2)*a(n)+(3*n^2+7*n+2)*a(n+1)+(-6-3*n)*a(n+2)+a(n+3)}

Sum_{k=0..floor(n/2)} n!/k!*binomial(n-1, 2*k-1). - Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 13 2003

MAPLE

spec := [S, {B=Sequence(Z, 1 <= card), C=Prod(B, B), S= Set(C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);

MATHEMATICA

nn = 20; a = x/(1 - x); Range[0, nn]! CoefficientList[Series[Exp[ a^2], {x, 0, nn}], x] (* Geoffrey Critzer, Dec 11 2011 *)

PROG

(Maxima) makelist(if n=0 then 1 else sum(n!/k!*binomial(n-1, 2*k-1), k, 0, floor(n/2)), n, 0, 18); [Bruno Berselli, May 25 2011]

CROSSREFS

Sequence in context: A130464 A006657 A105927 * A052867 A179495 A097237

Adjacent sequences:  A052884 A052885 A052886 * A052888 A052889 A052890

KEYWORD

easy,nonn

AUTHOR

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

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 14:37 EST 2012. Contains 205822 sequences.