id:A079728 - OEIS Search Results

Search: id:A079728

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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, 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, 1, 3, 1, 1, 3, 3, 3, 1, 1, 3, 1, 3, 1 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`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).`
	PROGRAM	`(PARI) a(n) = sum(k=0, prime(n), binomial(2*k, k))%prime(n)`
	CROSSREFS	`Cf. A002476, A003627, A006134.` `Sequence in context: A136644 A111963 A078079 this_sequence A029244 A067513 A116372` `Adjacent sequences: A079725 A079726 A079727 this_sequence A079729 A079730 A079731`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 17 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research