38456038702domain: NAppears in sequencesA(n, k) is the k-th number b > 1 such that b^(prime(n+i)-1) == 1 (mod prime(n+i)^2) for each i = 0..7, with k running over the positive integers; square array, read by antidiagonals, downwards.at n=18A319065