|
%I #9 Jan 16 2013 06:13:21
%S 0,2,5,1,6,9,7,0,8,8,1,1,6,2,7,7,7,0,0,8,1,1,6,6,8,6,9,7,0,8,9,4,4,7,
%T 4,7,7,7,2,2,2,5,2,5,3,6,5,1,9,2,0,0,3,7,7,7,7,0,0,8,1,5,6,4,7,5,6,6,
%U 0,3,1,1,3,3,3,8,8,0,8,0,4,0,4,7,7,5,5,7,2,8,3,2,4,2,4,9,9,8,1,9,9,3,3,3,6
%N a(n) = Mod[n+(Mod[Prime[n],7]-3),10]
%C Cycle of integers modulo 10 on symbols {1,2,3,4,5,6,7,8,9,0} coded by the primes modulo 7.
%C More information is contained in this modulation code than modulo 3. These codes were inspired by the cyclic typo: if a probabilistic version is used on a large text like several pages, a message could be hidden to appear to be typos.
%t digits=200 a=Table[Mod[n+(Mod[Prime[n], 7]-3), 10], {n, 1, digits}]
%K nonn
%O 1,2
%A _Roger L. Bagula_, Jan 17 2004
|
