Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052761
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052761 3!*n*S2(n-1,3). +0
1
0, 0, 0, 0, 24, 180, 900, 3780, 14448, 52164, 181500, 615780, 2052072, 6749028, 21976500, 71007300, 228009696, 728451972, 2317445100, 7346047140, 23213772120 (list; graph; listen)
OFFSET

0,5

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 718

FORMULA

E.g.f.: exp(x)^3*x-3*exp(x)^2*x+3*x*exp(x)-x

Recurrence: {a(1)=0, a(2)=0, a(3)=0, a(4)=24, (-36*n^2-66*n-6*n^3-36)*a(n)+(11*n^3+55*n^2+66*n)*a(n+1)+(-6*n^3-24*n^2-18*n)*a(n+2)+(n^3+3*n^2+2*n)*a(n+3)}

MAPLE

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

CROSSREFS

Sequence in context: A136380 A019583 A087887 this_sequence A073993 A052758 A143040

Adjacent sequences: A052758 A052759 A052760 this_sequence A052762 A052763 A052764

KEYWORD

easy,nonn

AUTHOR

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

EXTENSIONS

Better description from Victor Adamchik (adamchik(AT)cs.cmu.edu), Jul 19 2001

page 1

Search completed in 0.005 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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research