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.

A050197 a(n) = least k satisfying a(k) = n in A050196.

Table of values

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

List of values

[1, 3, 4, 7, 5, 9, 19, 6, 11, 16, 21, 8, 13, 49, 18, 23, 41, 10, 46, 15, 51, 20, 56, 25, 43, 61, 12, 48, 66, 17, 53, 71, 22, 40, 58, 27, 94, 45, 63, 14, 130, 50, 68, 117, 37, 135, 55, 73, 24, 91, 42, 60, 109, 29, 127, 96, 47, 65, 114, 83, 34]