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 A342796 #29 Jun 27 2023 11:47:36
%S A342796 709682,77784248,6126191066,427218509360,28245026082242,
%T A342796 1821452259070568,116065734824421866,7353059854962677600,
%U A342796 464513906582191544402,29303821259651224580888,1847364138146506201033466,116421875056692663153073040
%N A342796 Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(6,n) (with n at least 4) missing three edges, where all three removed edges are incident to the same vertex in the 6-point set.
%C A342796 Start with a complete bipartite graph K(6,n) with vertex sets A and B where |A| = 6 and |B| is at least 4. We can arrange the points in sets A and B such that h(A,B) = d(a,b) for all a in A and b in B, where h is the Hausdorff metric. The pair [A,B] is a configuration. Then a set C is between A and B at location s if h(A,C) = h(C,B) = h(A,B) and h(A,C) = s. Call a pair ab, where a is in A and b is in B an edge. This sequence provides the number of sets between sets A' and B' at location s in a new configuration [A',B'] obtained from [A,B] by removing three edges, where all three removed edges are incident to the same point in A. So this sequence tells the number of sets at each location on the line segment between A' and B'.
%C A342796 Number of {0,1} 6 X n matrices (with n at least 4) with three fixed zero entries all in the same row and no zero rows or columns.
%C A342796 Take a complete bipartite graph K(6,n) (with n at least 4) having parts A and B where |A| = 6. This sequence gives the number of edge covers of the graph obtained from this K(6,n) graph after removing three edges, where all three removed edges are incident same vertex in A.
%H A342796 Steven Schlicker, Roman Vasquez, and Rachel Wofford, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL26/Wofford/wofford4.html">Integer Sequences from Configurations in the Hausdorff Metric Geometry via Edge Covers of Bipartite Graphs</a>, J. Int. Seq. (2023) Vol. 26, Art. 23.6.6.
%H A342796 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (120,-4593,69688,-428787,978768,-615195).
%F A342796 a(n) = 29791*63^(n-3) - 46666*31^(n-3) + 20305*15^(n-3) - 3700*7^(n-3) + 275*3^(n-3) - 5.
%Y A342796 Sequences of segments from removing edges from bipartite graphs A335608-A335613, A337416-A337418, A340173-A340175, A340199-A340201, A340897-A340899, A342580, A342796, A342850, A340403-A340405, A340433-A340438, A341551-A341553, A342327-A342328, A343372-A343374, A343800. Polygonal chain sequences A152927, A152928, A152929, A152930, A152931, A152932, A152933, A152934, A152939. Number of {0,1} n X n matrices with no zero rows or columns A048291.
%K A342796 easy,nonn
%O A342796 4,1
%A A342796 _Roman I. Vasquez_, Mar 24 2021