1,7

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.

P. Di Francesco, P. Zinn-Justin and J.-B. Zuber, Determinant formulae for some tiling problems...

Cf. A036506 (labeled 4-trees).

Sequence in context: A030837 A143872 A130756 this_sequence A166355 A031154 A090091

Adjacent sequences: A078790 A078791 A078792 this_sequence A078794 A078795 A078796

nonn

Gordon Royle (gordon(AT)maths.uwa.edu.au), Dec 05 2002