cp's OEIS Frontend

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.

%I A250100 #9 Nov 12 2014 22:56:55
%S A250100 0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,0,2,2,1,0,0,0,1,1,1,2,2,2,3,3,2,2,
%T A250100 2,1,2,2,1,1,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,2,4,4,3,3,3,2,4,4,
%U A250100 3,2,2,1,2,2,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0
%N 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.
%C A250100 Running count of missing odd numbers in A084937.
%H A250100 N. J. A. Sloane, <a href="/A250100/b250100.txt">Table of n, a(n) for n = 1..100000</a>
%e A250100 After step 7 of A084937, here is what we have:
%e A250100 1 2 3 4 5 6 7 ... n
%e A250100 1 2 3 5 4 7 9 ... A084937(n)
%e A250100 so m = 9, and the missing numbers < 9 are 6 and 8, both even, so a(7) = 0.
%Y A250100 Cf. A084937, A249686, A250099. See A249777, A249856, A249857 for another way of looking at this question.
%K A250100 nonn
%O A250100 1,19
%A A250100 _N. J. A. Sloane_, Nov 12 2014