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.

A361198 Consider a perfect infinite binary tree with nodes labeled with distinct positive integers where n appears at level A082850(n) and each level is filled from left to right; a(n) is the sibling of n in this tree.

Table of values

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

List of values

[2, 1, 6, 5, 4, 3, 14, 9, 8, 13, 12, 11, 10, 7, 30, 17, 16, 21, 20, 19, 18, 29, 24, 23, 28, 27, 26, 25, 22, 15, 62, 33, 32, 37, 36, 35, 34, 45, 40, 39, 44, 43, 42, 41, 38, 61, 48, 47, 52, 51, 50, 49, 60, 55, 54, 59, 58, 57, 56, 53, 46, 31, 126, 65, 64, 69, 68]