Array T(n,k) = least integer congruent to prime(i) mod prime(i+1) for all k <= i <= k+n; n, k >= 1; read by upward diagonals.

A268491

Array T(n,k) = least integer congruent to prime(i) mod prime(i+1) for all k <= i <= k+n; n, k >= 1; read by upward diagonals.

Terms

    a(0) =2a(1) =8a(2) =3a(3) =68a(4) =33a(5) =5a(6) =1118a(7) =348a(8) =40a(9) =7a(10) =2273a(11) =2273a(12) =271a(13) =128a(14) =11a(15) =197468a(16) =27298a(17) =10281a(18) =557a(19) =115a(20) =13a(21) =1728998a(22) =112383a(23) =112383a(24) =20005a(25) =3209a(26) =302a(27) =17a(28) =1728998a(29) =1728998

External references