A216231 - cp's OEIS frontend

A216231 Fibonacci with priority for primes: a(0)=0, a(1)=1, for n >= 2, a(n) = a(n-1) + a(k), where 0 < k <= n-2 is maximal index such that a(n-1) + a(k) is prime. If there is no such k, then a(n) = a(n-1) + a(n-2).

n	a(n)
0	0
1	1
2	1
3	2
4	3
5	5
6	7
7	12
8	19
9	31
10	43
11	74
12	79
13	153
14	227
15	239
16	313
17	552
18	631
19	643
20	1274
21	1427
22	1979
23	3253
24	5232
25	7211
26	7213
27	14424
28	14737
29	15289
30	20521
31	20533
32	41054
33	41281
34	82335
35	83609
36	83621
37	88853
38	90127
39	104551
40	194678
41	201889
42	207121
43	212353
44	226777
45	226789

[0, 1, 1, 2, 3, 5, 7, 12, 19, 31, 43, 74, 79, 153, 227, 239, 313, 552, 631, 643, 1274, 1427, 1979, 3253, 5232, 7211, 7213, 14424, 14737, 15289, 20521, 20533, 41054, 41281, 82335, 83609, 83621, 88853, 90127, 104551, 194678, 201889, 207121, 212353, 226777, 226789]

cp's OEIS Frontend

A216231 Fibonacci with priority for primes: a(0)=0, a(1)=1, for n >= 2, a(n) = a(n-1) + a(k), where 0 < k <= n-2 is maximal index such that a(n-1) + a(k) is prime. If there is no such k, then a(n) = a(n-1) + a(n-2).

Table of values

List of values