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.

A249686 After A084937(n) has been computed, let m = largest term so far in A084937. Then a(n) = number of positive 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 5
13 6
14 5
15 6
16 7
17 6
18 5
19 10
20 9
21 8
22 7
23 6
24 7
25 10
26 9
27 10
28 13
29 12
30 13
31 16
32 15
33 14
34 15
35 14
36 13
37 16
38 15
39 14
40 15
41 14
42 13
43 16
44 15
45 16
46 17
47 16
48 17
49 16
50 15
51 16
52 17
53 16
54 17
55 18
56 17
57 20
58 21
59 20
60 23
61 28
62 27
63 26
64 27
65 26
66 25
67 30
68 29
69 28
70 27
71 26
72 25
73 28

List of values

[0, 0, 0, 1, 0, 1, 2, 1, 2, 3, 2, 5, 6, 5, 6, 7, 6, 5, 10, 9, 8, 7, 6, 7, 10, 9, 10, 13, 12, 13, 16, 15, 14, 15, 14, 13, 16, 15, 14, 15, 14, 13, 16, 15, 16, 17, 16, 17, 16, 15, 16, 17, 16, 17, 18, 17, 20, 21, 20, 23, 28, 27, 26, 27, 26, 25, 30, 29, 28, 27, 26, 25, 28]

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

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