|
%I #14 Apr 21 2021 04:22:00
%S 2,0,0,2,1,0,2,1,0,1,1,2,1,0,2,0,1,1,2,1,0,1,0,1,2,1,0,2,1,0,2,1,2,1,
%T 1,1,2,0,2,0,1,1,1,0,2,1,1,0,2,1,0,1,1,1,2,0,1,1,2,1,0,0,2,1,0,2,1,2,
%U 2,1,0,1,2,0,1,0,1,2,1,1,1,1,1,0,1,0
%N a(n) = (prime(n) mod 5) mod 3.
%H Clark Kimberling, <a href="/A244738/b244738.txt">Table of n, a(n) for n = 1..4000</a>
%e n ... prime(n) mod 5 mod 3
%e 1 ..... 2 ..... 2 ... 2
%e 2 ..... 3 ..... 3 ... 0
%e 3 ..... 5 ..... 0 ... 0
%e 4 ..... 7 ..... 2 ... 2
%e 5 ..... 11 .... 1 ... 1
%e 6 ..... 13 .... 3 ... 0
%t z = 300; u = Mod[Table[Mod[Prime[n], 5], {n, 1, z}], 3] (* A244738 *)
%t v1 = Flatten[Position[u, 0]] (* A244739 *)
%t v2 = Flatten[Position[u, 1]] (* A024707 *)
%t v3 = Flatten[Position[u, 2]] (* A244741 *)
%t Mod[Mod[Prime[Range[90]],5],3] (* _Harvey P. Dale_, Aug 14 2019 *)
%Y Cf. A039703, A244739, A024707, A244741, A244735.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Jul 05 2014
|
