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.

A283833 For t >= 0, if 2^t + t - 3 <= n <= 2^t + t - 1 then a(n) = 2^t - 1, while if 2^t + t - 1 < n < 2^(t+1) + t - 3 then a(n) = 2^(t+1) + t - 2 - n.

Table of values

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

List of values

[1, 1, 1, 3, 3, 3, 2, 1, 7, 7, 7, 6, 5, 4, 3, 2, 1, 15, 15, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 31, 31, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 63, 63, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52]