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.
%I A005979 M4000 #21 Jul 08 2025 16:40:18 %S A005979 5,45,420,4130,42480,453350,4986860,56251230,648055650,7601584050, %T A005979 90556803600,1093417607850,13359234113250,164935358510470, %U A005979 2055350730457020,25827268868350690,326989527294142480,4168165020885948440,53462092704596804720 %N A005979 Number of Hamiltonian rooted triangulations with n internal nodes and 5 external nodes. %D A005979 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005979 _Peter J. Taylor_, <a href="/A005979/b005979.txt">Table of n, a(n) for n = 0..500</a> %H A005979 P. N. Rathie, <a href="http://dx.doi.org/10.1016/0012-365X(73)90046-0">The enumeration of Hamiltonian polygons in rooted planar triangulations</a>, Discrete Math., 6 (1973), 163-168. %F A005979 a(n) = f(n, 5) where f(n, k) is defined in A003122. - _Sean A. Irvine_, Feb 02 2015 %o A005979 (C#) See A003122 %K A005979 nonn %O A005979 0,1 %A A005979 _N. J. A. Sloane_ %E A005979 More terms and title clarified by _Sean A. Irvine_, Feb 02 2015