A079728 - OEIS

This site is supported by donations to The OEIS Foundation.

A079728

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

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; refs; listen; history; text; internal format)

	OFFSET	`1,2`
	LINKS	`Table of n, a(n) for n=1..81.`
	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).`
	PROG	`(PARI) a(n) = sum(k=0, prime(n), binomial(2*k, k))%prime(n)`
	CROSSREFS	`Cf. A002476, A003627, A006134.` `Sequence in context: A206923 A078079 A176982 * A181801 A029244 A067513` `Adjacent sequences: A079725 A079726 A079727 * A079729 A079730 A079731`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre, Feb 17 2003`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified May 22 01:49 EDT 2013. Contains 225509 sequences.