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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A343374 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 exactly two removed edges are incident to the same vertex in the 5-point set and exactly two removed edges are incident to the same vertex in the other set. 36
58984, 2445394, 86336272, 2843754442, 90733504504, 2851869796354, 88998264600352, 2767824089452282, 85935878802252424, 2666013369738472114, 82676439390965238832, 2563420051241406849322, 79472778433612932113944, 2463757486872117920024674, 76378002443759735050203712 (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 exactly two removed edges are incident to the same point in A and 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 row and exactly two zero entries occur in one 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 exactly two removed edges are incident to the same vertex in A and 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

Table of n, a(n) for n=4..18.

Index entries for linear recurrences with constant coefficients, signature (57,-1002,6562,-15381,9765).

FORMULA

a(n) = 105*31^(n-2) - 217*15^(n-2) + 148*7^(n-2) - 13*3^(n-1) + 3.

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: A217603 A205233 A235953 * A321826 A255893 A046323

Adjacent sequences:  A343371 A343372 A343373 * A343375 A343376 A343377

KEYWORD

easy,nonn

AUTHOR

Steven Schlicker, Apr 12 2021

EXTENSIONS

Typo in a(14) corrected by Georg Fischer, Dec 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 17:26 EST 2022. Contains 350479 sequences. (Running on oeis4.)