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.

A255565 a(0) = 0; for n >= 1: if n = A255411(k) for some k, then a(n) = 2*a(k), otherwise, n = A256450(h) for some h, and a(n) = 1 + 2*a(h).

Table of values

n a(n)
0 0
1 1
2 3
3 7
4 2
5 15
6 5
7 31
8 11
9 63
10 23
11 127
12 6
13 47
14 255
15 13
16 14
17 95
18 4
19 511
20 27
21 29
22 30
23 191
24 9
25 1023
26 55
27 59
28 61
29 383
30 19
31 2047
32 111
33 119
34 123
35 767
36 39
37 4095
38 223
39 239
40 247
41 1535
42 79
43 8191
44 447
45 479
46 495
47 3071
48 10
49 159
50 16383
51 895
52 62
53 959
54 991
55 6143
56 21
57 319
58 32767
59 1791
60 22
61 125
62 1919
63 1983
64 126
65 12287
66 46
67 43
68 639
69 65535
70 254
71 3583
72 12

List of values

[0, 1, 3, 7, 2, 15, 5, 31, 11, 63, 23, 127, 6, 47, 255, 13, 14, 95, 4, 511, 27, 29, 30, 191, 9, 1023, 55, 59, 61, 383, 19, 2047, 111, 119, 123, 767, 39, 4095, 223, 239, 247, 1535, 79, 8191, 447, 479, 495, 3071, 10, 159, 16383, 895, 62, 959, 991, 6143, 21, 319, 32767, 1791, 22, 125, 1919, 1983, 126, 12287, 46, 43, 639, 65535, 254, 3583, 12]