cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A000103 Number of n-node triangulations of sphere in which every node has degree >= 4.

Original entry on oeis.org

0, 0, 1, 1, 2, 5, 12, 34, 130, 525, 2472, 12400, 65619, 357504, 1992985, 11284042, 64719885, 375126827, 2194439398, 12941995397, 76890024027, 459873914230, 2767364341936, 16747182732792
Offset: 4

Views

Author

Keywords

Examples

			a(4)=0, a(5)=0 because the tetrahedron and the 5-bipyramid both have vertices of degree 3. a(6)=1 because of the A000109(6)=2 triangulations with 6 nodes (abcdef) the one corresponding to the octahedron (bcde,afec,abfd,acfe,adfb,bedc) has no node of degree 3, whereas the other triangulation (bcdef,afec,abed,ace,adcbf,aeb) has 2 such nodes.
		

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Cf. all triangulations: A000109, triangulations with minimum degree 5: A081621.

Extensions

More terms from Hugo Pfoertner, Mar 24 2003
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm) from the Surftri web site, May 05 2007