login
sum(k=0,p,binomial(2*k,k)) (mod p) where p runs through the primes.
0

%I #7 Mar 30 2012 18:39:12

%S 1,2,1,3,1,3,1,3,1,1,3,3,1,3,1,1,1,3,3,1,3,3,1,1,3,1,3,1,3,1,3,1,1,3,

%T 1,3,3,3,1,1,1,3,1,3,1,3,3,3,1,3,1,1,3,1,1,1,1,3,3,1,3,1,3,1,3,1,3,3,

%U 1,3,1,1,3,3,3,1,1,3,1,3,1

%N sum(k=0,p,binomial(2*k,k)) (mod p) where p runs through the primes.

%F a(1) = 1 a(2) = 2 a(prime(n)) = 3 if prime(n) is in A002476 a(prime(n)) = 1 otherwise (i.e. if prime(n) is in A003627).

%o (PARI) a(n) = sum(k=0, prime(n),binomial(2*k,k))%prime(n)

%Y Cf. A002476, A003627, A006134.

%K nonn

%O 1,2

%A _Benoit Cloitre_, Feb 17 2003