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.

A249943 a(n) = smallest k such that the numbers 1..n appear among A098550(1), ..., A098550(k), or a(n) = 0 if there is no such k.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 9
6 10
7 15
8 15
9 15
10 16
11 22
12 22
13 23
14 23
15 23
16 23
17 30
18 31
19 43
20 43
21 43
22 43
23 51
24 51
25 51
26 51
27 51
28 51
29 61
30 61
31 62
32 62
33 62
34 62
35 62
36 62
37 79
38 79
39 79
40 79
41 87
42 87
43 88
44 88
45 88
46 88
47 101

List of values

[1, 2, 3, 4, 9, 10, 15, 15, 15, 16, 22, 22, 23, 23, 23, 23, 30, 31, 43, 43, 43, 43, 51, 51, 51, 51, 51, 51, 61, 61, 62, 62, 62, 62, 62, 62, 79, 79, 79, 79, 87, 87, 88, 88, 88, 88, 101]