id:A106671 - OEIS Search Results

Search: id:A106671

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

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

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research