OFFSET
1,2
COMMENTS
By Dirichlet's Theorem there are an infinite number of primes in this sequence.
LINKS
Michel Marcus, Table of n, a(n) for n = 1..2000
FORMULA
a(n) = 3*a(n-1) - a(n-2) if a(n-1) is prime, else a(n) = 2*a(n-1) - a(n-2) for n>3. - John Tyler Rascoe, Jul 20 2022
EXAMPLE
The noncomposites among the first 8 terms of the sequence are 1, 2, 5, 13 and 97. The sum of these is 1+2+5+13+97 = 118. So a(9) = a(8) + 118 = 215.
MATHEMATICA
f[lst_] := Append[lst, Last@ lst + Plus @@ Select[lst, (PrimeQ@ # || # == 1) &]]; Nest[f, {1}, 38] (* Robert G. Wilson v, Jul 02 2007 *)
PROG
(PARI) lista(nn) = my(va = vector(nn), s = 1); va[1] = 1; for (n=2, nn, va[n] = va[n-1] + s; if (isprime(va[n]), s += va[n]); ); va; \\ Michel Marcus, Jul 21 2022
(Python)
from sympy import isprime
from itertools import islice
def A104589_gen(): # generator of terms
a, b = 1, 1
while True:
yield a
a += b
b += a if isprime(a) else 0
CROSSREFS
KEYWORD
nonn
AUTHOR
Leroy Quet, Jun 12 2007
EXTENSIONS
More terms from Robert G. Wilson v, Jul 02 2007
STATUS
approved