login
a(n) = Mod[10-Mod[Prime[n+3],10],4]-Mod[n,4]+3.
0

%I #6 Sep 03 2022 22:32:32

%S 5,2,3,6,3,4,1,4,5,2,3,6,5,2,1,6,3,4,1,6,3,4,1,6,5,2,3,6,3,4,1,4,3,4,

%T 3,6,5,2,1,4,5,4,1,4,5,4,1,6,3,2,1,6,5,2,1,6,3,4,3,6,3,4,3,4,5,4,1,6,

%U 3,4,3,4,5,2,3,4,3,2,1,4,5,2,3,4,5,2,3,6,3,4,1,4,5,2,1,6,3,4,3,6,3,2,3,6,5

%N a(n) = Mod[10-Mod[Prime[n+3],10],4]-Mod[n,4]+3.

%C A coding of the primes {1,3,7,9} digits using mode using modulo four as a pretransform.

%C This coding loses one degree of freedom in the process.

%t digits=200 Table[Mod[10-Mod[Prime[n+3], 10], 4]-Mod[n, 4]+3, {n, 1, digits}]

%K nonn

%O 3,1

%A _Roger L. Bagula_, Jan 20 2004