A106671 - OEIS

This site is supported by donations to The OEIS Foundation.

A106671

a(n) = Mod[Prime[n + 2]*Prime[n] - Prime[n + 1]^2, 3].

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

	OFFSET	`0,2`
	MATHEMATICA	`a = Table[Mod[Prime[n + 2]*Prime[n] - Prime[n + 1]^2, 3], {n, 1, 200}]`
	CROSSREFS	`Sequence in context: A093488 A085858 A188172 * A033776 A117371 A117370` `Adjacent sequences: A106668 A106669 A106670 * A106672 A106673 A106674`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 13 2005`

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

Last modified February 14 23:44 EST 2012. Contains 205689 sequences.