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

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

%S 4,16,106,1156,15016,255256,4849846,111546436,3234846616,100280245066,

%T 3710369067406,152125131763606,6541380665835016,307444891294245706,

%U 16294579238595022366,961380175077106319536,58644190679703485491636

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

%F a(n)=(1/2)*(A006862(n)+1)

%K easy,nonn

%O 2,1

%A _Benoit Cloitre_, May 30 2002