|
%I #4 Mar 12 2014 16:36:54
%S 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,
%T 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,
%U 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
%N 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}.
%C There are long runs of "1"'s.
%F 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
%t a = Partition[Table[1 + Mod[Prime[n], 3], {n, 3, 203}], 2] /. {2, 3} -> 1 /. {3, 2} -> 2 /. { 2, 2} -> 3 /. {3, 3} -> 4
%K nonn,uned
%O 1,1
%A _Roger L. Bagula_, Aug 29 2006
|
