OFFSET
1,1
COMMENTS
By Dirichlet's Theorem, there are an infinite number of primes in this sequence.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
FORMULA
a(n+1) = a(n) + Sum_{k=1..n} A010051(a(k)). - Reinhard Zumkeller, Nov 15 2011
EXAMPLE
There are 5 primes (2,3,5,11,19) among the first 7 terms of the sequence. So a(8) = a(7) + 5 = 24.
MATHEMATICA
f[lst_] := Append[lst, Last@lst + Length@ Select[lst, PrimeQ@# &]]; Nest[f, {2}, 56] (* Robert G. Wilson v, Jul 02 2007 *)
PROG
(Haskell)
a131073 n = a131073_list !! (n-1)
a131073_list = 2 : f 2 1 where
f x c = y : f y (c + a010051 y) where y = x + c
-- Reinhard Zumkeller, Nov 15 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Leroy Quet, Jun 13 2007
EXTENSIONS
More terms from Robert G. Wilson v, Jul 02 2007
STATUS
approved