A233526 - cp's OEIS frontend

A233526 Start with a(1) = 1, a(2) = 3, then a(n)*2^k = a(n+1) + a(n+2), with 2^k the smallest power of 2 (k>0) such that all terms a(n) are positive integers.

n	a(n)
1	1
2	3
3	1
4	5
5	3
6	7
7	5
8	9
9	1
10	17
11	15
12	19
13	11
14	27
15	17
16	37
17	31
18	43
19	19
20	67
21	9
22	125
23	19
24	231
25	73
26	389
27	195
28	583
29	197
30	969
31	607
32	1331
33	1097
34	1565
35	629
36	2501

[1, 3, 1, 5, 3, 7, 5, 9, 1, 17, 15, 19, 11, 27, 17, 37, 31, 43, 19, 67, 9, 125, 19, 231, 73, 389, 195, 583, 197, 969, 607, 1331, 1097, 1565, 629, 2501]

cp's OEIS Frontend

A233526 Start with a(1) = 1, a(2) = 3, then a(n)*2^k = a(n+1) + a(n+2), with 2^k the smallest power of 2 (k>0) such that all terms a(n) are positive integers.

Table of values

List of values