a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1) <= prime(n), otherwise a(n) = a(n-1) mod prime(n).
A387775
a(1) = 2; for n > 1, a(n) = a(n-1)*prime(n) if a(n-1) <= prime(n), otherwise a(n) = a(n-1) mod prime(n).
Terms
- a(0) =2a(1) =6a(2) =1a(3) =7a(4) =77a(5) =12a(6) =204a(7) =14a(8) =322a(9) =3a(10) =93a(11) =19a(12) =779a(13) =5a(14) =235a(15) =23a(16) =1357a(17) =15a(18) =1005a(19) =11a(20) =803a(21) =13a(22) =1079a(23) =11a(24) =1067a(25) =57a(26) =5871a(27) =93a(28) =10137a(29) =80
External references
- oeis: A387775