Let p = n-th prime; a(n) = number of pairs (i,j) with 0 < i < p, 0 < j < p such that i*j == 1 mod p and i and j have opposite parity.
A085623
Let p = n-th prime; a(n) = number of pairs (i,j) with 0 < i < p, 0 < j < p such that i*j == 1 mod p and i and j have opposite parity.
Terms
- a(0) =0a(1) =2a(2) =0a(3) =4a(4) =6a(5) =10a(6) =4a(7) =12a(8) =18a(9) =4a(10) =14a(11) =18a(12) =20a(13) =16a(14) =30a(15) =32a(16) =30a(17) =20a(18) =28a(19) =34a(20) =32a(21) =40a(22) =46a(23) =54a(24) =46a(25) =48a(26) =64a(27) =62a(28) =66a(29) =40
External references
- oeis: A085623