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.

A361103 a(n) = k such that A360519(k) = A361102(n), or -1 if A361102(n) never appears in A360519.

Table of values

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

List of values

[1, 2, 3, 6, 11, 14, 10, 7, 5, 16, 19, 28, 20, 23, 9, 24, 4, 27, 32, 18, 15, 31, 36, 34, 40, 35, 39, 30, 44, 68, 8, 52, 42, 48, 64, 51, 26, 22, 72, 56, 41, 47, 76, 55, 46, 43, 12, 80, 60, 59, 63, 38, 84, 49, 88, 87, 21, 92, 50, 96, 33, 91, 67, 13, 71, 95, 100, 53, 104, 99, 75, 54, 112, 108]