|
%I #15 Dec 26 2023 21:23:34
%S 0,1,1,15,1,1,15,7,1,15,1,1,15,1,7,15,1,1,15,1,1,0,1,1,15,1,1,15,7,1,
%T 15,1,1,15,1,7,15,1,1,15,1,1,0,1,1,15,1,1,15,7,1,15,1,1,15,1,7,15,1,1,
%U 15,1,1,0,1,1,15,1,1,15,7,1,15,1,1,15,1,7,15,1,1,15,1,1,0,1,1,15,1,1
%N a(n) = n^6 mod 21.
%H <a href="/index/Rec#order_21">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, 1).
%F a(n) = a(n-21). - _Wesley Ivan Hurt_, Dec 26 2023
%t PowerMod[Range[0,90],6,21] (* or *) PadRight[{},90,{0,1,1,15,1,1,15,7,1,15,1,1,15,1,7,15,1,1,15,1,1}] (* _Harvey P. Dale_, Aug 10 2019 *)
%o (Sage) [power_mod(n,6,21)for n in range(0, 90)] # _Zerinvary Lajos_, Nov 06 2009
%o (PARI) a(n)=n^6%21 \\ _Charles R Greathouse IV_, Apr 06 2016
%K nonn,easy
%O 0,4
%A _N. J. A. Sloane_, May 13 2002
|
