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.

A361324 a(n) = k such that A361321(k) = A000469(n), or -1 if A000469(n) never appears in A361321.

Table of values

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

List of values

[1, 2, 3, 8, 11, 5, 7, 15, 24, 6, 18, 4, 19, 10, 14, 30, 21, 12, 20, 34, 38, 16, 33, 25, 23, 42, 13, 37, 48, 17, 53, 45, 9, 50, 58, 28, 83, 36, 61, 29, 55, 79, 40, 62, 22, 65, 49, 54, 66, 27, 69, 41, 59, 70, 32, 35, 73, 47, 39, 74, 60, 26, 44, 87, 78, 93, 63, 98, 52, 64, 43, 101, 77, 86, 102]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.