Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129050
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129050 Number of n-node triangulations of the nonorientable surface N_3 in which every node has degree >= 4. +0
1
0, 133, 9385, 298323, 6162345, 97905411, 1308857389, 15516720575, 168565283562, 1714609792914 (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: A020265 A028295 A133240 this_sequence A129049 A015264 A055579

Adjacent sequences: A129047 A129048 A129049 this_sequence A129051 A129052 A129053

KEYWORD

nonn

AUTHOR

njas, 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research