a(1) = 1; for n > 1, a(n) = (a(n-1) + n) mod prime(n).

A088521

a(1) = 1; for n > 1, a(n) = (a(n-1) + n) mod prime(n).

Terms

    a(0) =1a(1) =0a(2) =3a(3) =0a(4) =5a(5) =11a(6) =1a(7) =9a(8) =18a(9) =28a(10) =8a(11) =20a(12) =33a(13) =4a(14) =19a(15) =35a(16) =52a(17) =9a(18) =28a(19) =48a(20) =69a(21) =12a(22) =35a(23) =59a(24) =84a(25) =9a(26) =36a(27) =64a(28) =93a(29) =10

External references