|
%I #21 Sep 08 2022 08:44:53
%S 2,3,5,1,5,1,5,1,5,5,1,1,5,1,5,5,5,1,1,5,1,1,5,5,1,5,1,5,1,5,1,5,5,1,
%T 5,1,1,1,5,5,5,1,5,1,5,1,1,1,5,1,5,5,1,5,5,5,5,1,1,5,1,5,1,5,1,5,1,1,
%U 5,1,5,5,1,1,1,5,5,1,5,1,5,1,5,1,1,5,5,1,5,1,5,5,1,5,1,5,5,5,1,1,1,5,5,5,1
%N a(n) = n-th prime modulo 6.
%H Nathaniel Johnston, <a href="/A039704/b039704.txt">Table of n, a(n) for n = 1..10000</a>
%p seq(ithprime(n) mod 6, n=1..105); # _Nathaniel Johnston_, Jun 29 2011
%t Table[Mod[Prime[n], 6], {n, 105}] (* _Nathaniel Johnston_, Jun 29 2011 *)
%t Mod[Prime[Range[100]], 6] (* _Vincenzo Librandi_, May 06 2014 *)
%o (PARI) primes(105)%6 \\ _Zak Seidov_, Mar 25 2012
%o (Magma) [p mod 6: p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 06 2014
%Y Cf. A000040, A039701-A039703, A039705, A039706, A038194, A007652, A039709-A039715.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_
|
