Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129043
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129043 Number of n-node triangulations of the projective plane N_1 in which every node has degree >= 3. +0
1
0, 1, 3, 16, 134, 1210, 11719, 114478, 1108826, 10606795, 100352404, 940956644, 8762227629, 81168427279, 748953936818 (list; graph; listen)
OFFSET

5,3

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: A023998 A048802 A119392 this_sequence A135746 A006057 A002719

Adjacent sequences: A129040 A129041 A129042 this_sequence A129044 A129045 A129046

KEYWORD

nonn

AUTHOR

njas, May 12 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 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research