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

%I #6 Mar 30 2012 18:39:02

%S 6,36,386,5006,85086,1616616,37182146,1078282206,33426748356,

%T 1236789689136,50708377254536,2180460221945006,102481630431415236,

%U 5431526412865007456,320460058359035439846,19548063559901161830546

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

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

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

%K easy,nonn

%O 3,1

%A _Benoit Cloitre_, May 30 2002