A137264 - OEIS

This site is supported by donations to The OEIS Foundation.

A137264

Prime number gaps read modulo 3.

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; refs; listen; history; internal format)

	OFFSET	`1,2`
	COMMENTS	`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.` `Sequence in context: A178819 A046816 A138328 * A193238 A167678 A078614` `Adjacent sequences: A137261 A137262 A137263 * A137265 A137266 A137267`
	KEYWORD	`easy,nonn`
	AUTHOR	`Noel H. Patson (n.patson(AT)cqu.edu.au), Mar 12 2008`

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

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.