A117964 - OEIS

This site is supported by donations to The OEIS Foundation.

A117964

A117963 mod 2.

1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,1`
	COMMENTS	`a(3n+2)=0, a(3n)=a(3n+1). a(3n) may be equal to A088917(n).`
	FORMULA	`a(n)=sum{k=0..floor(n/2), L(C(n-k,k)/3)} mod 2 where L(j/p) is the Legendre symbol of j and p.`
	CROSSREFS	`Sequence in context: A011642 A016338 A113052 * A179020 A179771 A094875` `Adjacent sequences: A117961 A117962 A117963 * A117965 A117966 A117967`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Apr 05 2006`

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

Last modified February 16 08:13 EST 2012. Contains 205893 sequences.