The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A342327 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 exactly two removed edges are incident to the same vertex in the other set. 4
 64705, 2542687, 87880249, 2867519047, 91094247025, 2857310964847, 89080092692329, 2769052985833687, 85954322576134945, 2666290098653287807, 82680590830861862809, 2563482326383161959527, 79473712585542654112465, 2463771499324688282695567 (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 exactly two 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 where exactly two zero entries occur in one column and no row has more than one zero entry, 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 all three removed edges are incident to different vertices in A but exactly two 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 Index entries for linear recurrences with constant coefficients, signature (57,-1002,6562,-15381,9765). FORMULA a(n) = 105*31^(n-2) - 185*15^(n-2) + 116*7^(n-2) - 29*3^(n-2) + 2. MATHEMATICA Array[105*31^(# - 2) - 185*15^(# - 2) + 116*7^(# - 2) - 29*3^(# - 2) + 2 &, 14, 4] (* Michael De Vlieger, Mar 19 2021 *) CROSSREFS Other sequences of segments from removing edges from bipartite graphs A335608-A335613, A337416-A337418, A340173-A340175, A340199-A340201, A340403-A340405, A341551-A341552, A342328. 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: A236469 A203712 A061738 * A198779 A104939 A183975 Adjacent sequences:  A342324 A342325 A342326 * A342328 A342329 A342330 KEYWORD easy,nonn AUTHOR Steven Schlicker, Mar 08 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 23 14:44 EDT 2021. Contains 346259 sequences. (Running on oeis4.)