id:A137264 - OEIS Search Results

Search: id:A137264

Displaying 1-1 of 1 results found.

page 1

Prime number gaps read modulo 3.

+0
1

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

	OFFSET	`1,2`
	COMMENT	`Conjecture: The only digit that is repeated in the sequence is 0 except for n=2 and n=3 where 2 repeats. So 1 may be followed by 2 or 0; 2 may be followed by 1 or 0; 0 may be followed by 0 or 1 or 2. this has been confirmed for the first million prime gaps.`
	MATHEMATICA	`n=1000; (The length of the list) Mod[Differences[Table[Prime[i], {i, n}]], 3]`
	CROSSREFS	`Cf. A001223.` `Adjacent sequences: A137261 A137262 A137263 this_sequence A137265 A137266 A137267` `Sequence in context: A089955 A046816 A138328 this_sequence A078614 A026607 A052005`
	KEYWORD	`easy,nonn`
	AUTHOR	`Noel H. Patson (n.patson(AT)cqu.edu.au), Mar 12 2008`

page 1

Search completed in 0.002 seconds

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.

AT&T Labs Research