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.

A354901 a(n) = (b(2n) - 1)/2 - n for n > 0. To get b(n) start with A = n and then for i = 0..f(n) apply A := A + 2^i*T(A, f(n) - i) where T(n, k) = floor(n/2^k) mod 2 and f(n) = A000523(n).

Table of values

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

List of values

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