cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 1
13 1
14 1
15 1
16 1
17 1
18 0
19 2
20 2
21 1
22 0
23 0
24 0
25 1
26 1
27 1
28 2
29 2
30 2
31 3
32 3
33 2
34 2
35 2
36 1
37 2
38 2
39 1
40 1
41 1
42 0
43 1
44 1
45 1
46 1
47 1
48 1
49 0
50 0
51 0
52 0
53 0
54 0
55 0
56 0
57 1
58 1
59 1
60 2
61 4
62 4
63 3
64 3
65 3
66 2
67 4
68 4
69 3
70 2
71 2
72 1
73 2
74 2
75 1
76 1
77 1
78 0
79 1
80 1
81 0
82 0
83 0
84 0
85 0
86 0
87 0
88 0
89 0
90 0

List of values

[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]