Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129060 Number of n-node triangulations of the nonorientable surface N_5 in which every node has degree >= 6. +0
1
0, 2, 5839, 1117750, 41548569 (list; graph; listen)
OFFSET

8,2

REFERENCES

G. Ringel, Wie man die geschlossenen nichtorientierbaren Flaechen in moeglichst wenig Dreiecke zerlegen kann, Math. Ann. 130 (1955), 317-326.

LINKS

Thom Sulanke, Generating triangulations of surfaces (surftri), (also subpages).

CROSSREFS

Sequence in context: A078933 A064029 A057645 this_sequence A099690 A107021 A107022

Adjacent sequences: A129057 A129058 A129059 this_sequence A129061 A129062 A129063

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 13 2007

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 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research