A064736 - cp's OEIS frontend

A064736 a(1)=1, a(2)=2; for n>0, a(2n+2) = smallest number missing from {a(1), ... ,a(2n)}, and a(2n+1) = a(2n)a(2n+2).

n	a(n)
1	1
2	2
3	6
4	3
5	12
6	4
7	20
8	5
9	35
10	7
11	56
12	8
13	72
14	9
15	90
16	10
17	110
18	11
19	143
20	13
21	182
22	14
23	210
24	15
25	240
26	16
27	272
28	17
29	306
30	18
31	342
32	19
33	399
34	21
35	462
36	22
37	506
38	23
39	552
40	24
41	600
42	25
43	650
44	26
45	702
46	27
47	756
48	28
49	812
50	29
51	870
52	30
53	930
54	31
55	992
56	32
57	1056
58	33
59	1122
60	34
61	1224
62	36

[1, 2, 6, 3, 12, 4, 20, 5, 35, 7, 56, 8, 72, 9, 90, 10, 110, 11, 143, 13, 182, 14, 210, 15, 240, 16, 272, 17, 306, 18, 342, 19, 399, 21, 462, 22, 506, 23, 552, 24, 600, 25, 650, 26, 702, 27, 756, 28, 812, 29, 870, 30, 930, 31, 992, 32, 1056, 33, 1122, 34, 1224, 36]

cp's OEIS Frontend

A064736 a(1)=1, a(2)=2; for n>0, a(2n+2) = smallest number missing from {a(1), ... ,a(2n)}, and a(2n+1) = a(2n)a(2n+2).

Table of values

List of values

cp's OEIS Frontend

A064736 a(1)=1, a(2)=2; for n>0, a(2*n+2) = smallest number missing from {a(1), ... ,a(2*n)}, and a(2*n+1) = a(2*n)*a(2*n+2).

Table of values

List of values

A064736 a(1)=1, a(2)=2; for n>0, a(2n+2) = smallest number missing from {a(1), ... ,a(2n)}, and a(2n+1) = a(2n)a(2n+2).