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.

A358291 a(n) = smallest k not already in the sequence such that OEIS entry Ak contains n.

Table of values

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

List of values

[1, 2, 3, 5, 6, 8, 9, 15, 10, 11, 13, 19, 17, 18, 14, 26, 16, 21, 20, 27, 22, 25, 37, 28, 56, 62, 47, 36, 48, 32, 29, 40, 61, 51, 44, 69, 24, 59, 113, 46, 33, 52, 41, 57, 73, 70, 68, 55, 80, 134, 53, 115, 93, 49, 50, 45, 78, 98, 66, 54, 31, 43, 64, 83, 79, 94, 84]

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

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