The number of primes among the n terms prime(n+1) mod (prime(1)..prime(n)).

0, 1, 1, 1, 2, 3, 2, 3, 3, 3, 4, 4, 3, 5, 4, 5, 3, 3, 5, 6, 6, 4, 7, 6, 5, 6, 6, 6, 8, 6, 7, 9, 6, 8, 6, 8, 9, 6, 7, 8, 9, 8, 10, 10, 7, 8, 8, 7, 9, 11, 11, 11, 10, 10, 9, 10, 10, 13, 11, 11, 12, 11, 12, 12, 11, 9, 11, 11, 10, 12, 15, 13, 14, 13, 13, 12, 12, 16

1

The n-th term is the number of primes in the n-th row of S000852. It appears that only the first row has no primes.

T. D. Noe, Plot of 1000 terms

T. D. Noe, Table of 1000 terms

(Mma) Table[Count[Mod[Prime[n + 1], Prime[Range[n]]], _?(PrimeQ[#] &)], {n, 50}]

Cf. S000852.

nonn

T. D. Noe, Feb 26 2016