Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052802
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052802 A simple grammar. +0
2
1, 1, 5, 47, 660, 12414, 293552, 8374806, 280064600, 10747277832, 465597887592, 22479948822792, 1197060450322800, 69699159437088960, 4405397142701855232, 300408348609092268144, 21983809533066553697280 (list; graph; listen)
OFFSET

0,3

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 760

FORMULA

Contribution from Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008: (Start)

E.g.f. satisfies: A(x*(1 + log(1-x))) = 1/(1 + log(1-x)).

E.g.f. satisfies: A(x) = 1/(1 + log(1 - x*A(x))).

E.g.f.: A(x) = (1/x)*Series_Reversion[x + x*log(1-x)]. (End)

EXAMPLE

E.g.f.: A(x) = 1 + x + 5*x^2/2! + 47*x^3/3! + 660*x^4/4! +... [From Paul D. Hanna (pauldhanna(AT)juno.com), Aug 28 2008]

MAPLE

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

PROGRAM

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

CROSSREFS

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

Sequence in context: A006902 A127696 A088691 this_sequence A098799 A089155 A086555

Adjacent sequences: A052799 A052800 A052801 this_sequence A052803 A052804 A052805

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research