A352885 Numbers k such that there are no trees with k edge coverings.

19, 37, 41, 57, 59, 67, 79, 82, 97, 111, 131, 149, 177, 179, 197, 201, 205, 223, 237, 251, 257, 269, 271, 277, 283, 291, 311, 331, 379, 397, 443, 449, 457, 461, 469, 553, 577, 587, 591, 603, 617, 649, 677, 679, 711, 733, 737, 758, 771, 797, 811, 829, 839, 849, 877, 881, 911, 985, 991, 993

Offset

1,1

Links

Table of n, a(n) for n=1..60.

Zakhar Ovsyannikov, Some possible numbers of edge coverings of a bipartite graph or shortest paths with fixed ends in a space of compact sets in R^n, arXiv:1312.2531 [math.MG], 2013.

Z. N. Ovsyannikov, The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in R^n, Doklady Mathematics, 93 (2016), 65-68.

Zakhar Ovsyannikov, C++ program example

Crossrefs

Sequence in context: A186405 A240238 A368833 * A354431 A059695 A134196

Adjacent sequences: A352882 A352883 A352884 * A352886 A352887 A352888

Keyword

nonn

Author

Zakhar Ovsyannikov, Apr 07 2022

Status

approved