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.

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.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.