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 A340434 #14 Jun 27 2023 11:32:50
%S A340434 57152,2248976,77784248,2538972344,80670722672,2530567728416,
%T A340434 78896594655848,2452545943242824,76130313033068192,
%U A340434 2361561349263377456,73231232199903981848,2270510693649412710104,70390969213953161845712,2182197113248136520812096,67649266538598993456642248
%N A340434 Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(5,n) (with n at least 4) missing three edges, where all three removed edges are incident to different vertices in the 5-point set but all three removed edges are incident to the same vertex in the other set.
%C A340434 Start with a complete bipartite graph K(5,n) with vertex sets A and B where |A| = 5 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 different points in A but all three removed edges are incident to the same point in B. So this sequence tells the number of sets at each location on the line segment between A' and B'.
%C A340434 Number of {0,1} 5 X n matrices (with n at least 4) with three fixed zero entries all of which are in the same column with no zero rows or columns.
%C A340434 Take a complete bipartite graph K(5,n) (with n at least 4) having parts A and B where |A| = 5. This sequence gives the number of edge covers of the graph obtained from this K(5,n) graph after removing three edges, where the removed edges are incident to different vertices in A and none of the removed edges are incident to the same vertex in B.
%H A340434 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.
%F A340434 a(n) = 3*31^(n-1) - 11*15^(n-1) + 15*7^(n-1) - 3^(n+1) + 2.
%Y A340434 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 A340434 easy,nonn
%O A340434 4,1
%A A340434 _Rachel Wofford_, Jan 07 2021