A071555 Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 3<=i<=n.

6, 36, 386, 5006, 85086, 1616616, 37182146, 1078282206, 33426748356, 1236789689136, 50708377254536, 2180460221945006, 102481630431415236, 5431526412865007456, 320460058359035439846, 19548063559901161830546

Offset

3,1

Links

Table of n, a(n) for n=3..18.

Formula

a(n)=1+A002110(n)/6

Prog

(PARI) for(n=3, 20, print1((prod(i=1, n, prime(i))+6)/6, ", "))

Crossrefs

Sequence in context: A265474 A277474 A137889 * A080491 A077704 A185085

Adjacent sequences: A071552 A071553 A071554 * A071556 A071557 A071558

Keyword

easy,nonn

Author

Benoit Cloitre, May 30 2002

Status

approved