OFFSET
1,1
COMMENTS
33 terms have been calculated; the last, having 13189 decimal digits, required 25197 iterations to compute. It is not known if the sequence continues beyond a(33).
EXAMPLE
a(1)+a(2)=2+3=5, so a(3)=5.
a(2)+a(3)=3+5=8 and 5+8=13, so a(4)=13.
MATHEMATICA
Block[{a = {2, 3}, j, k, s}, Do[Set[{j, k}, a[[-2 ;; -1]]]; While[! PrimeQ[Set[s, j + k]], Set[{j, k}, {k, s}]]; AppendTo[a, s], {i, Length@ a + 1, 12}]; a] (* Michael De Vlieger, Mar 04 2021 *)
PROG
(Python)
from sympy import isprime
def aupton(terms):
alst = [2, 3]
for n in range(3, terms+1):
fnm2, fnm1 = alst[-2:]
while not isprime(fnm2 + fnm1): fnm2, fnm1 = fnm1, fnm2+fnm1
alst.append(fnm2 + fnm1)
return alst
print(aupton(16)) # Michael S. Branicky, Mar 04 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
David James Sycamore, Mar 04 2021
STATUS
approved