This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A005502 Triangulations of the disk R_{n,3}. (Formerly M2904) 2
 3, 11, 53, 295, 1867, 12560, 89038, 652198, 4903955, 37627699, 293607612 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Graphs can be enumerated and counted using the tool "plantri", in particular the command "./plantri -s -P6 -c2m2 [n]". - Manfred Scheucher, Mar 08 2018 REFERENCES C. F. Earl and L. J. March, Architectural applications of graph theory, pp. 327-355 of R. J. Wilson and L. W. Beineke, editors, Applications of Graph Theory. Academic Press, NY, 1979. N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS G. Brinkmann and B. McKay, Plantri (program for generation of certain types of planar graph) C. F. Earl and L. J. March, Architectural applications of graph theory, pp. 327-355 of R. J. Wilson and L. W. Beineke, editors, Applications of Graph Theory. Academic Press, NY, 1979. (Annotated scanned copy) C. F. Earl & N. J. A. Sloane, Correspondence, 1980-1981 FORMULA a(n) = (A005507(n) + A005495(n))/2 (based on Max Alekseyev's formula, cf. A005501 and A005500). CROSSREFS A row or column of the array in A169808. Sequence in context: A053557 A039302 A074512 * A305710 A000255 A318912 Adjacent sequences:  A005499 A005500 A005501 * A005503 A005504 A005505 KEYWORD nonn,more AUTHOR EXTENSIONS a(5)-a(10) from Manfred Scheucher, Mar 08 2018 STATUS approved

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

Last modified October 16 13:23 EDT 2019. Contains 328084 sequences. (Running on oeis4.)