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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 6
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, 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, 3, 2, 2, 1, 2, 2, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,19

COMMENTS

Running count of missing odd numbers in A084937.

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 1..100000

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 numbers < 9 are 6 and 8, both even, so a(7) = 0.

CROSSREFS

Cf. A084937, A249686, A250099. See A249777, A249856, A249857 for another way of looking at this question.

Sequence in context: A089069 A143535 A301366 * A339627 A016270 A219493

Adjacent sequences:  A250097 A250098 A250099 * A250101 A250102 A250103

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Nov 12 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 00:49 EDT 2021. Contains 343937 sequences. (Running on oeis4.)