Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052801
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052801 A simple grammar: labeled pairs of sequences of cycles. +0
1
1, 2, 8, 46, 342, 3108, 33324, 411360, 5741856, 89379120, 1534623936, 28804923024, 586686138384, 12885385945248, 303537419684064, 7633673997722496, 204125888803996800, 5782960189212871680 (list; graph; listen)
OFFSET

0,2

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 759

FORMULA

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

a(n) = Sum_{k=0..n} (-1)^(n-k)*Stirling1(n, k)*(k+1)!. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 21 2003

MAPLE

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

CROSSREFS

Adjacent sequences: A052798 A052799 A052800 this_sequence A052802 A052803 A052804

Sequence in context: A088791 A111552 A128085 this_sequence A074599 A007289 A099765

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research