A331631 - cp's OEIS frontend

A331631 Let S = smallest missing positive number, adjoin S, 3S, 9S, 27S, 81S, ... 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	3
3	9
4	27
5	81
6	2
7	6
8	18
9	54
10	162
11	4
12	12
13	36
14	108
15	324
16	5
17	15
18	7
19	21
20	63
21	189
22	567
23	8
24	24
25	72
26	216
27	648
28	10
29	30
30	90
31	270
32	810
33	11
34	33
35	99
36	297
37	891
38	2673
39	8019
40	24057
41	72171
42	216513
43	649539
44	1948617
45	5845851
46	17537553
47	52612659
48	157837977
49	473513931
50	1420541793
51	4261625379
52	12784876137
53	38354628411
54	13
55	39

[1, 3, 9, 27, 81, 2, 6, 18, 54, 162, 4, 12, 36, 108, 324, 5, 15, 7, 21, 63, 189, 567, 8, 24, 72, 216, 648, 10, 30, 90, 270, 810, 11, 33, 99, 297, 891, 2673, 8019, 24057, 72171, 216513, 649539, 1948617, 5845851, 17537553, 52612659, 157837977, 473513931, 1420541793, 4261625379, 12784876137, 38354628411, 13, 39]

cp's OEIS Frontend

A331631 Let S = smallest missing positive number, adjoin S, 3S, 9S, 27S, 81S, ... 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

A331631 Let S = smallest missing positive number, adjoin S, 3*S, 9*S, 27*S, 81*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

A331631 Let S = smallest missing positive number, adjoin S, 3S, 9S, 27S, 81S, ... to the sequence until reaching a term that has S as a substring; reset S to the smallest missing positive number, repeat.