Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #21 May 25 2022 09:14:50
%S 19,37,41,57,59,67,79,82,97,111,131,149,177,179,197,201,205,223,237,
%T 251,257,269,271,277,283,291,311,331,379,397,443,449,457,461,469,553,
%U 577,587,591,603,617,649,677,679,711,733,737,758,771,797,811,829,839,849,877,881,911,985,991,993
%N Numbers k such that there are no trees with k edge coverings.
%H Zakhar Ovsyannikov, <a href="https://arxiv.org/abs/1312.2531">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</a>, arXiv:1312.2531 [math.MG], 2013.
%H Z. N. Ovsyannikov, <a href="https://doi.org/10.1134/S1064562416010221">The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in R^n</a>, Doklady Mathematics, 93 (2016), 65-68.
%H Zakhar Ovsyannikov, <a href="/A352885/a352885.txt">C++ program example</a>
%K nonn
%O 1,1
%A _Zakhar Ovsyannikov_, Apr 07 2022