A340403 Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(4,n) (with n at least 4) missing three edges, where the removed edges are incident to different vertices in the 4-point set and none of the removed edges are incident to the same vertex in the other set.

3740, 66914, 1084508, 16848674, 256844060, 3881598434, 58426959068, 877826523554, 13177356595100, 197730071456354, 2966439163566428, 44500004197580834, 667523980478413340, 10013027130697435874, 150196578927865178588, 2252956887698068132514

Offset

4,1

Comments

Start with a complete bipartite graph K(4,n) with vertex sets A and B where |A| = 4 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 the removed edges are incident to different points in A and none of the 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} 4 X n matrices (with n at least 4) with three fixed zero entries none of which are in the same row or column with no zero rows or columns.

Take a complete bipartite graph K(4,n) (with n at least 4) having parts A and B where |A| = 4. This sequence gives the number of edge covers of the graph obtained from this K(4,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.

Links

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

Steven Schlicker, Roman Vasquez, and Rachel Wofford, Integer Sequences from Configurations in the Hausdorff Metric Geometry via Edge Covers of Bipartite Graphs, J. Int. Seq. (2023) Vol. 26, Art. 23.6.6.

Index entries for linear recurrences with constant coefficients, signature (26,-196,486,-315).

Formula

a(n) = 343*15^(n-3) - 216*7^(n-3) + 4*3^(n-1) - 1.

From Stefano Spezia, Jan 06 2021: (Start)

G.f.: 2*x^4*(1870 - 15163*x + 38892*x^2 - 25515*x^3)/(1 - 26*x + 196*x^2 - 486*x^3 + 315*x^4).

a(n) = 26*a(n-1) - 196*a(n-2) + 486*a(n-3) - 315*a(n-4) for n > 7. (End)

Mathematica

LinearRecurrence[{26, -196, 486, -315}, {3740, 66914, 1084508, 16848674}, 20] (* Harvey P. Dale, Sep 18 2021 *)

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: A038012 A020410 A166262 * A235977 A235243 A368589

Adjacent sequences: A340400 A340401 A340402 * A340404 A340405 A340406

Keyword

easy,nonn

Author

Rachel Wofford, Jan 06 2021

Status

approved