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.

A309195 a(n) = smallest number missing from A111273 after A111273(n) has been found.

Table of values

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

List of values

[2, 2, 4, 4, 4, 4, 6, 8, 8, 8, 8, 8, 8, 8, 10, 10, 10, 10, 12, 12, 12, 12, 16, 16, 16, 16, 16, 16, 16, 16, 24, 26, 26, 26, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 36, 36, 36, 36, 36, 36, 36, 36, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 48, 48]