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.

A337066 a(n) is the smallest k such that A336957(k) = n, or -1 if n does not appear in A336957.

Table of values

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

List of values

[1, 2, -1, -1, -1, 3, -1, -1, -1, 10, -1, 7, -1, 6, 4, -1, -1, 11, -1, 15, 12, 14, -1, 35, -1, 18, -1, 19, -1, 31, -1, -1, 8, 22, 5, 39, -1, 23, 17, 27, -1, 30, -1, 43, 16, 26, -1, 67, -1, 42, 21, 47, -1, 71, 9, 34, 24, 51, -1, 63, -1, 46, 20, -1, 28, 75, -1, 55, 25, 50, -1, 79, -1, 54, 36, 38]