Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105668
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105668 Number of non-separable rooted triangulations (with n vertices) in which any vertex has degree at least 4. +0
1
1, 3, 12, 59, 325, 1875, 11029, 65607, 393750, 2382084, 14517939, 89091558, 550217901, 3418171915, 21351207168 (list; graph; listen)
OFFSET

6,2

REFERENCES

O. Bernardi, On triangulations with high vertex degree, Formal Power Series and Algebraic Combinatorics 2005.

CROSSREFS

Sequence in context: A003316 A126959 A058861 this_sequence A064856 A080337 A101054

Adjacent sequences: A105665 A105666 A105667 this_sequence A105669 A105670 A105671

KEYWORD

nonn

AUTHOR

Olivier Bernardi (bernardi(AT)labri.fr), May 04 2005

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 December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research