login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = n^7 mod 13.
0

%I #17 Dec 19 2023 13:43:16

%S 0,1,11,3,4,8,7,6,5,9,10,2,12,0,1,11,3,4,8,7,6,5,9,10,2,12,0,1,11,3,4,

%T 8,7,6,5,9,10,2,12,0,1,11,3,4,8,7,6,5,9,10,2,12,0,1,11,3,4,8,7,6,5,9,

%U 10,2,12,0,1,11,3,4,8,7,6,5,9,10,2,12,0,1,11,3,4,8,7,6,5,9,10,2,12,0,1

%N a(n) = n^7 mod 13.

%H <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%t PowerMod[Range[0,100],7,13] (* _Harvey P. Dale_, Jan 19 2016 *)

%o (Sage) [power_mod(n,7,13) for n in range(93)] # _Zerinvary Lajos_, Oct 28 2009

%o (PARI) a(n)=n^7%13 \\ _Charles R Greathouse IV_, Apr 06 2016

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, May 13 2002