Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078793
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078793 Number of unlabeled 4-trees on n vertices. +0
1
0, 0, 0, 1, 1, 1, 2, 5, 15, 64, 331, 2150, 15817, 127194, 1077639 (list; graph; listen)
OFFSET

1,7

COMMENT

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 this_sequence A166355 A031154 A090091

Adjacent sequences: A078790 A078791 A078792 this_sequence A078794 A078795 A078796

KEYWORD

nonn

AUTHOR

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

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