login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129048 Number of n-node triangulations of the Klein bottle N_2 in which every node has degree >= 5. 0

%I #3 Mar 30 2012 16:50:41

%S 0,5,38,250,1246,6043,27260,120389,517897,2198806,9219045

%N Number of n-node triangulations of the Klein bottle N_2 in which every node has degree >= 5.

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

%H Thom Sulanke, <a href="http://hep.physics.indiana.edu/~tsulanke/graphs/surftri/">Generating triangulations of surfaces (surftri)</a>, (also subpages).

%K nonn

%O 7,2

%A _N. J. A. Sloane_, May 13 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 2 14:21 EST 2024. Contains 370493 sequences. (Running on oeis4.)