a(1) = 2; for n > 1, a(n) = (a(n-1) + prime(n)) mod n.
A088523
a(1) = 2; for n > 1, a(n) = (a(n-1) + prime(n)) mod n.
Terms
- a(0) =2a(1) =1a(2) =0a(3) =3a(4) =4a(5) =5a(6) =1a(7) =4a(8) =0a(9) =9a(10) =7a(11) =8a(12) =10a(13) =11a(14) =13a(15) =2a(16) =10a(17) =17a(18) =8a(19) =19a(20) =8a(21) =21a(22) =12a(23) =5a(24) =2a(25) =25a(26) =20a(27) =15a(28) =8a(29) =1
External references
- oeis: A088523