login
A250099
After A084937(n) has been computed, let m = largest term so far in A084937. Then a(n) = number of positive even integers < m that are missing from A084937 at this point.
6
0, 0, 0, 1, 0, 1, 2, 1, 2, 3, 2, 4, 5, 4, 5, 6, 5, 5, 8, 7, 7, 7, 6, 7, 9, 8, 9, 11, 10, 11, 13, 12, 12, 13, 12, 12, 14, 13, 13, 14, 13, 13, 15, 14, 15, 16, 15, 16, 16, 15, 16, 17, 16, 17, 18, 17, 19, 20, 19, 21, 24, 23, 23, 24, 23, 23, 26, 25, 25, 25, 24, 24, 26, 25
OFFSET
1,7
COMMENTS
Running count of missing even numbers in A084937.
LINKS
EXAMPLE
After step 7 of A084937, here is what we have:
1 2 3 4 5 6 7 ... n
1 2 3 5 4 7 9 ... A084937(n)
so m = 9, and the missing even numbers < 9 are 6 and 8, so a(7) = 2.
CROSSREFS
Cf. A084937, A249686, A250100. See A249777, A249856, A249857 for another way of looking at this question.
Sequence in context: A029839 A082304 A321664 * A241949 A288126 A214720
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 12 2014
STATUS
approved