The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

A250100

After A084937(n) has been computed, let m = largest term so far in A084937. Then a(n) = number of positive odd integers < m that are missing from A084937 at this point.