login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064521 Number of rooted 5-connected planar triangulations with 2n faces. 0
1, 0, 6, 13, 55, 189, 694, 2516, 9213, 33782, 124300, 458502, 1695469, 6284175, 23344173, 86904615, 324197100, 1211841846, 4538611107, 17029834923, 64014608376, 241046175666, 909171583214, 3434698413540, 12995770332449 (list; graph; refs; listen; history; text; internal format)
OFFSET

10,3

COMMENTS

No planar triangulation can be more than 5-connected. The 5-connected triangulations are historically important to the 4-color problem.

REFERENCES

Z. J. Gao, I. M. Wanless and N. C. Wormald, Counting 5-connected planar triangulations, J. Graph Theory, Vol. 38 (2001), pp. 18-35.

LINKS

Table of n, a(n) for n=10..34.

EXAMPLE

The smallest 5-connected planar triangulation is the icosahedron, which has 20 faces. Because of its symmetry it has a unique rooting, so a(10)=1. The triangulations counted by a(12) and a(13) are drawn in the paper cited above.

MAPLE

# G.f. for 5-connected planar triangulations: fiveconntri(m) returns the first m terms of a power series in w, in which the coefficient of w^n is the number of (rooted) 5-connected planar triangulations with 2n faces.

fiveconntri := proc(howmanyterms) local keepterms, T, iteration, sval, previous; keepterms := howmanyterms+1; T := -3*w^3/(1+w)+w-w^2+3*w^3-w^4+4*(s+1)^3*((3*s-1)*w+(3*s-2)*(s+1)^3)*w/((3*s+2+w-s^3)^3); iteration := s-(-w^2+2*(4*s^2+2*s+1)*(s+1)^2*w+s*(s+2)*(s+1)^4)/(8*w+2); sval := 0; previous := -1; while(sval<>previous) do previous := sval; sval := mtaylor(subs(s=sval, iteration), [w, s], keepterms); od: series(subs(s=sval, T), w, keepterms); end;

CROSSREFS

Sequence in context: A203977 A003757 A187985 * A111366 A177127 A177175

Adjacent sequences:  A064518 A064519 A064520 * A064522 A064523 A064524

KEYWORD

nonn

AUTHOR

Ian M. Wanless (wanless(AT)maths.ox.ac.uk), Oct 07 2001

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified August 27 17:06 EDT 2014. Contains 246147 sequences.