A079053 - cp's OEIS frontend

A079053 Recamán Fibonacci variation: a(1)=1; a(2)=2; for n > 2, a(n) = a(n-1)+a(n-2)-F(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+a(n-2)+F(n) where F(n) denotes the n-th Fibonacci number.

n	a(n)
1	1
2	2
3	5
4	4
5	14
6	10
7	11
8	42
9	19
10	6
11	114
12	264
13	145
14	32
15	787
16	1806
17	996
18	218
19	5395
20	12378
21	6827
22	1494
23	36978
24	84840
25	46793
26	10240
27	253451
28	581502
29	320724
30	70186
31	1737179
32	3985674
33	2198275
34	481062
35	11906802
36	27318216
37	15067201
38	3297248
39	81610435

[1, 2, 5, 4, 14, 10, 11, 42, 19, 6, 114, 264, 145, 32, 787, 1806, 996, 218, 5395, 12378, 6827, 1494, 36978, 84840, 46793, 10240, 253451, 581502, 320724, 70186, 1737179, 3985674, 2198275, 481062, 11906802, 27318216, 15067201, 3297248, 81610435]

cp's OEIS Frontend

A079053 Recamán Fibonacci variation: a(1)=1; a(2)=2; for n > 2, a(n) = a(n-1)+a(n-2)-F(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+a(n-2)+F(n) where F(n) denotes the n-th Fibonacci number.

Table of values

List of values