A331440 - cp's OEIS frontend

A331440 Let S = smallest missing positive number, adjoin S, 2S, 4S, 8S, 16S, ... to the sequence until reaching a term that has S as a substring; reset S to the smallest missing positive number, repeat.

n	a(n)
1	1
2	2
3	4
4	8
5	16
6	3
7	6
8	12
9	24
10	48
11	96
12	192
13	384
14	5
15	10
16	20
17	40
18	80
19	160
20	320
21	640
22	1280
23	2560
24	7
25	14
26	28
27	56
28	112
29	224
30	448
31	896
32	1792
33	9
34	18
35	36
36	72
37	144
38	288
39	576
40	1152
41	2304
42	4608
43	9216
44	11
45	22
46	44
47	88
48	176
49	352
50	704
51	1408
52	2816
53	5632
54	11264
55	13
56	26
57	52
58	104
59	208
60	416

[1, 2, 4, 8, 16, 3, 6, 12, 24, 48, 96, 192, 384, 5, 10, 20, 40, 80, 160, 320, 640, 1280, 2560, 7, 14, 28, 56, 112, 224, 448, 896, 1792, 9, 18, 36, 72, 144, 288, 576, 1152, 2304, 4608, 9216, 11, 22, 44, 88, 176, 352, 704, 1408, 2816, 5632, 11264, 13, 26, 52, 104, 208, 416]

cp's OEIS Frontend

A331440 Let S = smallest missing positive number, adjoin S, 2S, 4S, 8S, 16S, ... to the sequence until reaching a term that has S as a substring; reset S to the smallest missing positive number, repeat.

Table of values

List of values

cp's OEIS Frontend

A331440 Let S = smallest missing positive number, adjoin S, 2*S, 4*S, 8*S, 16*S, ... to the sequence until reaching a term that has S as a substring; reset S to the smallest missing positive number, repeat.

Table of values

List of values

A331440 Let S = smallest missing positive number, adjoin S, 2S, 4S, 8S, 16S, ... to the sequence until reaching a term that has S as a substring; reset S to the smallest missing positive number, repeat.