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.

A354143 a(n) = smallest number missing from A353733 after A353733(n) has been found.

Table of values

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

List of values

[1, 2, 3, 3, 3, 3, 3, 7, 7, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 13, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 23, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 31, 43, 43, 43, 43, 43, 43]

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

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