Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052819
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052819 A simple grammar. +0
2
0, 1, 2, 15, 188, 3300, 74484, 2054864, 66998448, 2520581400, 107472778320, 5121576763512, 269759385873504, 15561785854196400, 975788232119245440, 66080957140527828480, 4806533577745476290304, 373724762062131412853760 (list; graph; listen)
OFFSET

0,3

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 784

FORMULA

E.g.f. satisfies: A(x + x*log(1-x)) = x. [From Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008]

MAPLE

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

PROGRAM

(PARI) a(n)=n!*polcoeff(serreverse(x+x*log(1-x +x*O(x^n))), n) [From Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008]

CROSSREFS

Cf. A052802. [From Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008]

Sequence in context: A052857 A053492 A098343 this_sequence A127090 A046249 A042355

Adjacent sequences: A052816 A052817 A052818 this_sequence A052820 A052821 A052822

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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research