The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 0
 57152, 2248976, 77784248, 2538972344, 80670722672, 2530567728416, 78896594655848, 2452545943242824, 76130313033068192, 2361561349263377456, 73231232199903981848, 2270510693649412710104, 70390969213953161845712, 2182197113248136520812096, 67649266538598993456642248 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,1 COMMENTS 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'. 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. 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. REFERENCES S. Schlicker, R. Vasquez, R. Wofford, Integer Sequences from Configurations in the Hausdorff Metric Geometry via Edge Covers of Bipartite Graphs. In preparation. LINKS FORMULA a(n) = 3*31^(n-1) - 11*15^(n-1) + 15*7^(n-1) - 3^(n+1) + 2. CROSSREFS 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. Sequence in context: A019290 A069335 A236152 * A352244 A233643 A166195 Adjacent sequences: A340431 A340432 A340433 * A340435 A340436 A340437 KEYWORD easy,nonn AUTHOR Rachel Wofford, Jan 07 2021 STATUS approved

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

Last modified December 8 14:17 EST 2022. Contains 358693 sequences. (Running on oeis4.)