Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052745
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052745 A simple grammar. +0
1
0, 0, 0, 6, 24, 110, 600, 3836, 28224, 235224, 2191680, 22584672, 255087360, 3134139840, 41620400640, 594082771200, 9070900715520, 147531542054400, 2546434166169600, 46489412442009600, 895079522340864000 (list; graph; listen)
OFFSET

0,4

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 701

FORMULA

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

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

a(n) = (-1)^(n+1)*2*n*Stirling1(n-1, 2). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 08 2003

MAPLE

spec := [S, {B=Cycle(Z), S=Prod(Z, B, B)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);

CROSSREFS

Sequence in context: A075484 A122739 A038380 this_sequence A109583 A100934 A127917

Adjacent sequences: A052742 A052743 A052744 this_sequence A052746 A052747 A052748

KEYWORD

easy,nonn

AUTHOR

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

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research