OFFSET
0,1
LINKS
David A. Corneth, Table of n, a(n) for n = 0..10000 (first 1331 terms from Chai Wah Wu)
EXAMPLE
There are no primes < 2, so a(0)=2.
The first time there is a pair of primes (i,j) less than some prime p with i*j == 1 mod p is when p=5 and i=2, j=3, so a(1)=5.
For n = 2 we take p = 19 and the pairs (3,13) and (7,11).
PROG
(PARI) nbpp(p) = {my(nb = 0); forprime(i=2, p-1, forprime(j=2, i-1, if ((i*j % p) == 1, nb ++); ); ); nb; }
a(n) = {my(p = 2); while (nbpp(p) != n, p = nextprime(p+1)); p; } \\ Michel Marcus, Nov 05 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
David James Sycamore, Oct 08 2018
EXTENSIONS
More terms from N. J. A. Sloane, Nov 02 2018
STATUS
approved