%I A081243
%S A081243 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,6,
%T A081243 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,0,0,
%U A081243 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 A081243 a(n) = Mod[n+(Mod[Prime[n],3]-1),10]
%C A081243 Modulo 10 integer cycle on symbols {1,2,3,4,5,6,7,8,9,0} coded with the 
               primes modulo 3.
%C A081243 The function : f[n_]=Mod[Prime[n],3]-1 is binary except for n=2.
%t A081243 digits=200 a=Table[Mod[n+(Mod[Prime[n], 3]-1), 10], {n, 1, digits}]
%Y A081243 Sequence in context: A165417 A108755 A093049 this_sequence A127480 A141446 
               A077965
%Y A081243 Adjacent sequences: A081240 A081241 A081242 this_sequence A081244 A081245 
               A081246
%K A081243 nonn
%O A081243 1,1
%A A081243 Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 17 2004