A108528 - OEIS

This site is supported by donations to The OEIS Foundation.

A108528

Number of increasing mobiles (cycle rooted trees) with n generators.

1, 2, 10, 92, 1216, 20792, 435520, 10793792, 308874016, 10021509632, 363509706880, 14576530558592, 640275236943616, 30573223563625472, 1576805482203235840, 87353392124392020992, 5173324070004374358016 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,2`
	COMMENTS	`In an increasing rooted tree, nodes are numbered and numbers increase as you move away from root.`
	LINKS	`Table of n, a(n) for n=1..17.` `Index entries for sequences related to mobiles`
	FORMULA	`E.g.f. satisfies 2A(x) = x - 1 + A'(x) - log(1-A(x))` `Contribution from Paul D. Hanna, Sep 11 2010: (Start)` `E.g.f. satisfies: (1+A(x))sqrt(1-A(x)^2) = exp(x).` `E.g.f.: A(x) = Series_Reversion[ log((1+x)*sqrt(1-x^2)) ]. (End)`
	PROG	`(PARI) {a(n)=n!polcoeff(serreverse(log((1+x)sqrt(1-x^2+O(x^(n+2))))), n)} [From Paul D. Hanna, Sep 11 2010]`
	CROSSREFS	`Cf. A108521-A108529, A029768.` `Sequence in context: A086587 A082472 A095937 * A181136 A182952 A108209` `Adjacent sequences: A108525 A108526 A108527 * A108529 A108530 A108531`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower, Jun 07 2005`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified May 21 10:03 EDT 2013. Contains 225478 sequences.