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”).
%I #24 Dec 26 2023 21:20:29
%S 0,1,14,4,21,0,6,24,19,16,0,11,9,9,11,0,16,19,24,6,0,21,4,14,1,0,1,14,
%T 4,21,0,6,24,19,16,0,11,9,9,11,0,16,19,24,6,0,21,4,14,1,0,1,14,4,21,0,
%U 6,24,19,16,0,11,9,9,11,0,16,19,24,6,0,21,4,14,1,0,1,14,4,21,0,6,24,19
%N a(n) = n^6 mod 25.
%C Periodic, with period 25: 0, 1, 14, 4, 21, 0, 6, 24, 19, 16, 0, 11, 9, 9, 11, 0, 16, 19, 24, 6, 0, 21, 4, 14, 1. - _Harvey P. Dale_, Oct 14 2014
%H <a href="/index/Rec#order_25">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, 0, 0, 1).
%F a(n) = a(n-25). - _Wesley Ivan Hurt_, Dec 26 2023
%t PowerMod[Range[0,100],6,25] (* _Harvey P. Dale_, Oct 14 2014 *)
%o (Sage) [power_mod(n,6,25) for n in range(0, 84)] # _Zerinvary Lajos_, Nov 06 2009
%o (Magma) [n^6 mod 25: n in [0..80]]; // _Vincenzo Librandi_, Oct 15 2014
%o (PARI) a(n)=n^6%25 \\ _Charles R Greathouse IV_, Apr 06 2016
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, May 13 2002