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.

A026367 a(n) = least k such that s(k) = n, where s = A026366.

Table of values

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

List of values

[1, 2, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18, 20, 21, 23, 24, 26, 27, 29, 30, 31, 32, 34, 35, 37, 38, 39, 40, 42, 43, 45, 46, 48, 49, 51, 52, 53, 54, 56, 57, 59, 60, 61, 62, 64, 65, 67, 68, 69, 70, 72, 73, 75, 76, 77, 78, 80, 81, 83, 84, 86]