A078793 - OEIS

This site is supported by donations to The OEIS Foundation.

A078793

Number of unlabeled 4-trees on n vertices.

0, 0, 0, 1, 1, 1, 2, 5, 15, 64, 331, 2150, 15817, 127194, 1077639, 9466983, 85252938, 782238933, 7283470324, 68639621442, 653492361220, 6276834750665, 60759388837299, 592227182125701, 5808446697002391, 57289008242377068, 567939935463185078 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,7`
	COMMENTS	`A k-tree is recursively defined as follows: K_k is a k-tree and any k-tree on n+1 vertices is obtained by joining a vertex to a k-clique in a k-tree on n vertices.`
	LINKS	`P. Di Francesco, P. Zinn-Justin and J.-B. Zuber, Determinant formulae for some tiling problems...`
	CROSSREFS	`Cf. A036506 (labeled 4-trees).` `Sequence in context: A030837 A143872 A130756 * A201702 A202037 A166355` `Adjacent sequences: A078790 A078791 A078792 * A078794 A078795 A078796`
	KEYWORD	`nonn`
	AUTHOR	`Gordon Royle (gordon(AT)maths.uwa.edu.au), Dec 05 2002`
	EXTENSIONS	`More terms from Andrew R. Gainer (againer(AT)brandeis.edu), Dec 03 2011`

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

Last modified February 13 15:49 EST 2012. Contains 205521 sequences.