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.

A169741 a(n) = smallest k such that A109671(k)=n, or -1 if n does not appear in A109671.

Table of values

n a(n)
1 1
2 3
3 7
4 39
5 17
6 15
7 169
8 33
9 31
10 135
11 313
12 231
13 337
14 1257
15 113
16 1341
17 65
18 63
19 1043
20 1077
21 937
22 4137
23 625
24 225
25 673
26 129
27 127
28 519
29 2057
30 903
31 2099
32 2157
33 1849
34 2493
35 2167
36 999
37 1081
38 2685
39 1873
40 8277
41 1249
42 7401
43 1343
44 8289
45 497
46 8349
47 1079
48 5373
49 4139
50 16827

List of values

[1, 3, 7, 39, 17, 15, 169, 33, 31, 135, 313, 231, 337, 1257, 113, 1341, 65, 63, 1043, 1077, 937, 4137, 625, 225, 673, 129, 127, 519, 2057, 903, 2099, 2157, 1849, 2493, 2167, 999, 1081, 2685, 1873, 8277, 1249, 7401, 1343, 8289, 497, 8349, 1079, 5373, 4139, 16827]