%I #6 Mar 30 2012 17:34:13
%S 2,1,4,4,6,6,8,8,0,1,1,2,4,4,6,7,8,8,9,1,1,2,4,5,5,7,7,9,9,1,1,3,4,4,
%T 6,6,7,8,0,1,2,2,4,4,6,6,7,8,0,0,2,3,3,5,6,7,8,8,9,1,1,3,3,5,5,7,7,8,
%U 0,0,2,3,3,4,5,7,8,8,0,0,2,2,4,4,5,7,8,8,0,0,2,3,3,5,5,7,8,9,9,0,1,3,4,5,5
%N a(n) = Mod[n+(Mod[Prime[n],3]1),10]
%C Modulo 10 integer cycle on symbols {1,2,3,4,5,6,7,8,9,0} coded with the primes modulo 3.
%C The function : f[n_]=Mod[Prime[n],3]1 is binary except for n=2.
%t digits=200 a=Table[Mod[n+(Mod[Prime[n], 3]1), 10], {n, 1, digits}]
%K nonn
%O 1,1
%A _Roger L. Bagula_, Jan 17 2004
