A341313 - cp's OEIS frontend

A341313 a(n) = (a(n-1) + a(n-3))/2^m, where 2^m is the highest power of 2 that divides both a(n-1) and a(n-3), with a(0) = a(1) = a(2) = 1.

n	a(n)
0	1
1	1
2	1
3	2
4	3
5	4
6	3
7	6
8	5
9	8
10	7
11	12
12	5
13	12
14	6
15	11
16	23
17	29
18	40
19	63
20	92
21	33
22	96
23	47
24	80
25	11
26	58
27	69
28	80
29	69
30	138
31	109
32	178
33	158
34	267
35	445
36	603
37	870
38	1315
39	1918
40	1394
41	2709
42	4627
43	6021
44	8730
45	13357
46	19378
47	14054
48	27411
49	46789
50	60843
51	88254
52	135043
53	195886
54	142070
55	277113
56	472999

[1, 1, 1, 2, 3, 4, 3, 6, 5, 8, 7, 12, 5, 12, 6, 11, 23, 29, 40, 63, 92, 33, 96, 47, 80, 11, 58, 69, 80, 69, 138, 109, 178, 158, 267, 445, 603, 870, 1315, 1918, 1394, 2709, 4627, 6021, 8730, 13357, 19378, 14054, 27411, 46789, 60843, 88254, 135043, 195886, 142070, 277113, 472999]

cp's OEIS Frontend

A341313 a(n) = (a(n-1) + a(n-3))/2^m, where 2^m is the highest power of 2 that divides both a(n-1) and a(n-3), with a(0) = a(1) = a(2) = 1.

Table of values

List of values