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.

A387071 a(n) is the least k such that A387070(k) = n. If no such k exists, a(n) = -1.

Table of values

n a(n)
0 0
1 276
2 5
3 6
4 2
5 76
6 25
7 26
8 261
9 3
10 2985
11 642
12 3606
13 462
14 320
15 3694
16 4
17 3205
18 2045
19 643
20 493
21 96
22 15
23 106
24 318
25 16
26 510
27 963
28 1091
29 503
30 452
31 2705
32 550
33 482
34 1520
35 1169
36 19
37 1462
38 4512
39 1428
40 97
41 2639
42 675
43 2055
44 12
45 216
46 119
47 6525
48 2135
49 7
50 726
51 246
52 674
53 2146
54 710
55 816
56 74
57 1026
58 7401
59 23
60 255
61 2490
62 75
63 2510
64 8
65 4782
66 1125
67 1923

List of values

[0, 276, 5, 6, 2, 76, 25, 26, 261, 3, 2985, 642, 3606, 462, 320, 3694, 4, 3205, 2045, 643, 493, 96, 15, 106, 318, 16, 510, 963, 1091, 503, 452, 2705, 550, 482, 1520, 1169, 19, 1462, 4512, 1428, 97, 2639, 675, 2055, 12, 216, 119, 6525, 2135, 7, 726, 246, 674, 2146, 710, 816, 74, 1026, 7401, 23, 255, 2490, 75, 2510, 8, 4782, 1125, 1923]