Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052860
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052860 A simple grammar: rooted sequences of cycles. +0
2
0, 1, 2, 9, 56, 440, 4164, 46046, 582336, 8288136, 131090880, 2280970032, 43298796672, 890441326320, 19720847692896, 467964024901200, 11844861486802944, 318549937907204352, 9070876711252816128 (list; graph; listen)
OFFSET

0,3

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 828

FORMULA

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

a(n) = n*A007840(n). a(n) = n!*Sum_{k=0..n-1} a(k)/k!/(n-k) for n>=1 with a(0)=0. - Paul D. Hanna (pauldhanna(AT)juno.com), Jul 19 2006

MAPLE

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

PROGRAM

(PARI) a(n)=n!*polcoeff(x/(1+log(1-x +x*O(x^n))), n) - Paul D. Hanna (pauldhanna(AT)juno.com), Jul 19 2006

CROSSREFS

Cf. A007840.

Sequence in context: A081004 A138740 A158883 this_sequence A052840 A036243 A033917

Adjacent sequences: A052857 A052858 A052859 this_sequence A052861 A052862 A052863

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research