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.

A354142 a(n) = smallest number missing from A352808 after A352808(n) has been found.

Table of values

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

List of values

[1, 2, 3, 3, 3, 3, 6, 6, 6, 6, 7, 11, 11, 11, 11, 11, 11, 11, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 23, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 30, 30, 30, 30, 30, 30, 31, 43, 43, 43, 43, 43, 43, 43, 43, 43, 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.