A319023 - cp's OEIS frontend

A319023 Let S be the sequence generated by these rules: 1 is in S, and if k is in S, then A057168(k) and A319021(k) are in S, and duplicates are deleted as they occur; a(n) is the n-th term of S.

n	a(n)
1	1
2	2
3	3
4	4
5	5
6	9
7	8
8	6
9	7
10	10
11	27
12	16
13	14
14	11
15	12
16	29
17	81
18	32
19	20
20	19
21	13
22	17
23	18
24	30
25	31
26	82
27	243
28	64
29	34
30	24
31	22
32	21
33	15
34	23
35	28
36	39
37	36
38	47
39	33
40	84
41	245
42	729
43	128
44	66
45	38
46	25
47	35
48	43
49	45
50	40
51	54
52	55
53	49
54	37
55	88
56	90
57	246
58	247
59	730
60	2187
61	256
62	130
63	68
64	72
65	41

[1, 2, 3, 4, 5, 9, 8, 6, 7, 10, 27, 16, 14, 11, 12, 29, 81, 32, 20, 19, 13, 17, 18, 30, 31, 82, 243, 64, 34, 24, 22, 21, 15, 23, 28, 39, 36, 47, 33, 84, 245, 729, 128, 66, 38, 25, 35, 43, 45, 40, 54, 55, 49, 37, 88, 90, 246, 247, 730, 2187, 256, 130, 68, 72, 41]

cp's OEIS Frontend

A319023 Let S be the sequence generated by these rules: 1 is in S, and if k is in S, then A057168(k) and A319021(k) are in S, and duplicates are deleted as they occur; a(n) is the n-th term of S.

Table of values

List of values