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.

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

Table of values

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

List of values

[1, 2, 3, 17, 9, 4, 8, 31, 15, 7, 5, 47, 64, 6, 21, 10, 96, 20, 11, 13, 57, 38, 14, 16, 79, 37, 18, 12, 160, 28, 22, 19, 61, 24, 26, 23, 131, 52, 27, 25, 41, 33, 46, 29, 77, 45, 42, 34, 54, 59, 36, 32, 68, 72, 44, 40, 104, 82, 50, 49, 75, 111, 51, 35, 98, 143, 63, 30, 85]

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

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