A091484 - cp's OEIS frontend

A091484 Recamán's Fibonacci variation : a(1)=a(2)=1 then a(n) = a(n-1)+a(n-2)-F(n) if that number is >0 and not already in the sequence; a(n) = a(n-1)+a(n-2)+F(n) otherwise where F(n) denotes the n-th Fibonacci number.

n	a(n)
1	1
2	1
3	4
4	2
5	11
6	5
7	3
8	29
9	66
10	40
11	17
12	201
13	451
14	275
15	116
16	1378
17	3091
18	1885
19	795
20	9445
21	21186
22	12920
23	5449
24	64737
25	145211
26	88555
27	37348
28	443714
29	995291
30	606965
31	255987
32	3041261
33	6821826
34	4160200
35	1754561
36	20845113
37	46757491
38	28514435
39	12025940

[1, 1, 4, 2, 11, 5, 3, 29, 66, 40, 17, 201, 451, 275, 116, 1378, 3091, 1885, 795, 9445, 21186, 12920, 5449, 64737, 145211, 88555, 37348, 443714, 995291, 606965, 255987, 3041261, 6821826, 4160200, 1754561, 20845113, 46757491, 28514435, 12025940]

cp's OEIS Frontend

A091484 Recamán's Fibonacci variation : a(1)=a(2)=1 then a(n) = a(n-1)+a(n-2)-F(n) if that number is >0 and not already in the sequence; a(n) = a(n-1)+a(n-2)+F(n) otherwise where F(n) denotes the n-th Fibonacci number.

Table of values

List of values