A129143 - cp's OEIS frontend

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

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

[1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 16, 17, 18, 19, 20, 32, 33, 34, 35, 36, 37, 64, 65, 66, 67, 68, 69, 70, 128, 129, 130, 131, 132, 133, 134, 135, 256, 257, 258, 259, 260, 261, 262, 263, 264, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 1024, 1025, 1026, 1027, 1028]

cp's OEIS Frontend

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

Table of values

List of values