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 #18 Dec 19 2023 14:09:06
%S 0,1,20,27,4,5,0,7,8,9,28,11,0,13,32,27,16,17,0,19,20,9,4,23,0,25,8,
%T 27,28,29,0,31,32,9,16,35,0,1,20,27,4,5,0,7,8,9,28,11,0,13,32,27,16,
%U 17,0,19,20,9,4,23,0,25,8,27,28,29,0,31,32,9,16,35,0,1,20,27,4,5,0,7,8,9,28
%N a(n) = n^7 mod 36.
%H Vincenzo Librandi, <a href="/A070717/b070717.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_36">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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%t PowerMod[Range[0,90],7,36] (* or *) PadRight[{},90,{0,1,20,27,4,5,0,7,8,9,28,11,0,13,32,27,16,17,0,19,20,9,4,23,0,25,8,27,28,29,0,31,32,9,16,35}] (* _Harvey P. Dale_, May 24 2017 *)
%o (Sage) [power_mod(n,7,36)for n in range(0, 83)] # - _Zerinvary Lajos_, Oct 29 2009
%o (PARI) a(n)=n^7%36 \\ _Charles R Greathouse IV_, Apr 06 2016
%o (Magma) [Modexp(n, 7, 36): n in [0..80]]; // _Vincenzo Librandi_, May 25 2017
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, May 13 2002