id:A113047 - OEIS Search Results

Search: id:A113047

Displaying 1-1 of 1 results found.

page 1

Binomial(3n,n)/(2n+1) mod 3.

+0
2

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

	OFFSET	`0,1`
	COMMENT	`Conjecture: a(n) differs from 0 only when n=(3^j-1)/2,j=0,1,...`
	CROSSREFS	`Cf. A003462, A039969.` `Sequence in context: A015024 A016039 A138149 this_sequence A127692 A023533 A010052` `Adjacent sequences: A113044 A113045 A113046 this_sequence A113048 A113049 A113050`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Oct 11 2005`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research