|
%I #17 Dec 19 2023 13:58:22
%S 0,1,13,2,8,17,3,5,12,4,14,7,16,9,19,11,18,20,6,15,21,10,22,0,1,13,2,
%T 8,17,3,5,12,4,14,7,16,9,19,11,18,20,6,15,21,10,22,0,1,13,2,8,17,3,5,
%U 12,4,14,7,16,9,19,11,18,20,6,15,21,10,22,0,1,13,2,8,17,3,5,12,4,14,7,16
%N a(n) = n^7 mod 23.
%H Vincenzo Librandi, <a href="/A070704/b070704.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_23">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%t PowerMod[Range[0, 100], 7, 23] (* _Vincenzo Librandi_, Jun 17 2016 *)
%o (Sage) [power_mod(n,7,23)for n in range(0, 82)] # _Zerinvary Lajos_, Oct 29 2009
%o (PARI) a(n)=n^7%23 \\ _Charles R Greathouse IV_, Apr 06 2016
%o (Magma) [Modexp(n, 7, 23): n in [0..80]]; // _Vincenzo Librandi_, Jun 17 2016
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, May 13 2002
|
