|
| |
|
|
A121806
|
|
Primes modulo three as two color partition maps { red, blue} of which there are four types:1-> {red, blue},2->{blue,red},3-> {red,red},4->{blue,blue}.
|
|
0
| |
|
|
2, 2, 2, 4, 3, 2, 4, 2, 1, 3, 4, 1, 1, 1, 1, 2, 2, 3, 4, 2, 2, 2, 3, 2, 4, 1, 4, 2, 1, 1, 1, 1, 3, 2, 4, 3, 1, 2, 2, 2, 2, 1, 2, 2, 4, 1, 1, 4, 3, 1, 4, 3, 4, 2, 3, 2, 1, 1, 4, 3, 4, 1, 1, 3, 1, 3, 2, 2, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 4, 3, 1, 2, 2, 1, 1, 3, 1, 1, 4, 3, 1, 1, 1, 4, 3, 4, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| There are long runs of "1"'s.
|
|
|
FORMULA
| a(n) = {1 + Mod[Prime[2*n-1], 3],1 + Mod[Prime[2*n], 3]/. {2, 3} -> 1 /. {3, 2} -> 2 /. { 2, 2} -> 3 /. {3, 3} -> 4
|
|
|
MATHEMATICA
| a = Partition[Table[1 + Mod[Prime[n], 3], {n, 3, 203}], 2] /. {2, 3} -> 1 /. {3, 2} -> 2 /. { 2, 2} -> 3 /. {3, 3} -> 4
|
|
|
CROSSREFS
| Sequence in context: A053204 A064025 A054709 * A056944 A194319 A050493
Adjacent sequences: A121803 A121804 A121805 * A121807 A121808 A121809
|
|
|
KEYWORD
| nonn,uned
|
|
|
AUTHOR
| Roger Bagula (rlbagulatftn(AT)yahoo.com), Aug 29 2006
|
| |
|
|
