id:A117964 - OEIS Search Results

Search: id:A117964

Displaying 1-1 of 1 results found.

page 1

A117963 mod 2.

+0
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; listen)

	OFFSET	`0,1`
	COMMENT	`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 this_sequence A094875 A012245 A089801` `Adjacent sequences: A117961 A117962 A117963 this_sequence A117965 A117966 A117967`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Apr 05 2006`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research