Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052673
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052673 A simple regular expression in a labeled universe. +0
3
0, 3, 12, 54, 288, 1800, 12960, 105840, 967680, 9797760, 108864000, 1317254400, 17244057600, 242853811200, 3661488230400, 58845346560000, 1004293914624000, 18140058832896000, 345728180109312000 (list; graph; listen)
OFFSET

0,2

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 621

FORMULA

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

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

3*n*n!

a(n) = A122972(n+2) - A122972(n) for n > 0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 21 2006

For n>0: a(n) = A083746(n+2). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 14 2007

MAPLE

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

CROSSREFS

Sequence in context: A006026 A158826 A107264 this_sequence A042971 A024038 A007199

Adjacent sequences: A052670 A052671 A052672 this_sequence A052674 A052675 A052676

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research