Smallest number m such that m = j^2 (mod prime(j)) for 1 <= j <= n.
A053665
Smallest number m such that m = j^2 (mod prime(j)) for 1 <= j <= n.
Terms
- a(0) =1a(1) =1a(2) =19a(3) =79a(4) =289a(5) =18769a(6) =198949a(7) =6325069a(8) =103321969a(9) =1218786319a(10) =98264184769
External references
- oeis: A053665