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.

A129142 Start with the empty sequence and append in step k the consecutive numbers 2^k-1 to 2^k+k-2.

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 8
6 9
7 15
8 16
9 17
10 18
11 31
12 32
13 33
14 34
15 35
16 63
17 64
18 65
19 66
20 67
21 68
22 127
23 128
24 129
25 130
26 131
27 132
28 133
29 255
30 256
31 257
32 258
33 259
34 260
35 261
36 262
37 511
38 512
39 513
40 514
41 515
42 516
43 517
44 518
45 519
46 1023
47 1024
48 1025
49 1026
50 1027
51 1028
52 1029
53 1030
54 1031
55 1032
56 2047

List of values

[1, 3, 4, 7, 8, 9, 15, 16, 17, 18, 31, 32, 33, 34, 35, 63, 64, 65, 66, 67, 68, 127, 128, 129, 130, 131, 132, 133, 255, 256, 257, 258, 259, 260, 261, 262, 511, 512, 513, 514, 515, 516, 517, 518, 519, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 2047]