id:A100810 - OEIS Search Results

Search: id:A100810

Displaying 1-1 of 1 results found.

page 1

a(n) = 0 if prime(n) + 2 = prime(n+1), otherwise 1.

+0
4

1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n) = 1 - A100821(n) = 1 - A062301(n+1).`
	EXAMPLE	`a(2) = 0 because prime(2) + 2 = 5 = prime(3).` `a(3) = 0 because prime(3) + 2 = 7 = prime(4).`
	MATHEMATICA	`Table[If[Prime[n] + 2 == Prime[n + 1], 0, 1], {n, 120}] (Ray Chandler)`
	CROSSREFS	`Sequence in context: A065043 A121559 A004641 this_sequence A114591 A060476 A005171` `Adjacent sequences: A100807 A100808 A100809 this_sequence A100811 A100812 A100813`
	KEYWORD	`easy,nonn`
	AUTHOR	`Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Jan 05 2005`
	EXTENSIONS	`Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 09 2005`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research