A113886 - cp's OEIS frontend

A113886 Finite recursive sequence with a(n) = a(a(n-2)) + a(n-a(n-1)).

n	a(n)
0	1
1	1
2	2
3	2
4	4
5	3
6	6
7	3
8	9
9	3
10	6
11	5
12	9
13	7
14	6
15	6
16	12
17	9
18	12
19	6
20	15
21	12
22	12
23	14
24	15
25	12
26	12
27	15
28	16
29	13
30	21
31	13
32	18
33	13
34	24
35	12
36	30
37	12
38	33
39	15
40	25
41	18
42	27
43	24
44	30
45	21
46	33
47	18
48	34
49	18
50	42
51	15
52	39
53	12
54	42
55	16
56	52
57	15
58	63

[1, 1, 2, 2, 4, 3, 6, 3, 9, 3, 6, 5, 9, 7, 6, 6, 12, 9, 12, 6, 15, 12, 12, 14, 15, 12, 12, 15, 16, 13, 21, 13, 18, 13, 24, 12, 30, 12, 33, 15, 25, 18, 27, 24, 30, 21, 33, 18, 34, 18, 42, 15, 39, 12, 42, 16, 52, 15, 63]

cp's OEIS Frontend

A113886 Finite recursive sequence with a(n) = a(a(n-2)) + a(n-a(n-1)).

Table of values

List of values

n	a(n)
0	1
1	1
2	2
3	2
4	4
5	3
6	6
7	3
8	9
9	3
10	6
11	5
12	9
13	7
14	6
15	6
16	12
17	9
18	12
19	6
20	15
21	12
22	12
23	14
24	15
25	12
26	12
27	15
28	16
29	13
30	21
31	13
32	18
33	13
34	24
35	12
36	30
37	12
38	33
39	15
40	25
41	18
42	27
43	24
44	30
45	21
46	33
47	18
48	34
49	18
50	42
51	15
52	39
53	12
54	42
55	16
56	52
57	15
58	63

n	a(n)
0	1
1	1
2	2
3	2
4	4
5	3
6	6
7	3
8	9
9	3
10	6
11	5
12	9
13	7
14	6
15	6
16	12
17	9
18	12
19	6
20	15
21	12
22	12
23	14
24	15
25	12
26	12
27	15
28	16
29	13
30	21
31	13
32	18
33	13
34	24
35	12
36	30
37	12
38	33
39	15
40	25
41	18
42	27
43	24
44	30
45	21
46	33
47	18
48	34
49	18
50	42
51	15
52	39
53	12
54	42
55	16
56	52
57	15
58	63

n	a(n)
0	1
1	1
2	2
3	2
4	4
5	3
6	6
7	3
8	9
9	3
10	6
11	5
12	9
13	7
14	6
15	6
16	12
17	9
18	12
19	6
20	15
21	12
22	12
23	14
24	15
25	12
26	12
27	15
28	16
29	13
30	21
31	13
32	18
33	13
34	24
35	12
36	30
37	12
38	33
39	15
40	25
41	18
42	27
43	24
44	30
45	21
46	33
47	18
48	34
49	18
50	42
51	15
52	39
53	12
54	42
55	16
56	52
57	15
58	63