OFFSET
0,5
COMMENTS
Original title: "Prime finding sequence recursion where the primes are sums of two integers".
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
EXAMPLE
15 + 16 = 31,
32 + 57 = 89,
713 + 980 = 1693,
19792 + 32005 = 51797,
237122034 + 314186695 = 551308729.
MATHEMATICA
Clear[a, n]; a[0] = 0; a[1] = 1; a[2] = 1; a[n_] := a[n] = If[PrimeQ[a[n - 1]], 1, a[n - 2] + a[n - 3]]; Table[a[n], {n, 0, 100}]
CROSSREFS
KEYWORD
nonn,less
AUTHOR
Roger L. Bagula, Sep 28 2008
EXTENSIONS
Edited by M. F. Hasler, Feb 09 2014
STATUS
approved