login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070541 a(n) = n^4 mod 22. 1

%I #18 Dec 18 2023 17:16:28

%S 0,1,16,15,14,9,20,3,4,5,12,11,12,5,4,3,20,9,14,15,16,1,0,1,16,15,14,

%T 9,20,3,4,5,12,11,12,5,4,3,20,9,14,15,16,1,0,1,16,15,14,9,20,3,4,5,12,

%U 11,12,5,4,3,20,9,14,15,16,1,0,1,16,15,14,9,20,3,4,5,12,11,12,5,4,3,20,9

%N a(n) = n^4 mod 22.

%C Equivalently: n^(10*m + 4) mod 22. - _G. C. Greubel_, Apr 05 2016

%H G. C. Greubel, <a href="/A070541/b070541.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_22">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, 1).

%F From _G. C. Greubel_, Apr 05 2016: (Start)

%F a(21*n) = 0.

%F a(n+21) = a(n). (End)

%t PowerMod[Range[0, 100], 4, 22] (* _G. C. Greubel_, Apr 05 2016 *)

%t PadRight[{},120,{0,1,16,15,14,9,20,3,4,5,12,11,12,5,4,3,20,9,14,15,16,1}] (* _Harvey P. Dale_, Feb 25 2017 *)

%o (Sage) [power_mod(n,4,22)for n in range(0, 84)] # _Zerinvary Lajos_, Oct 31 2009

%o (Magma) [Modexp(n, 4, 22): n in [0..100]]; // _Vincenzo Librandi_, Apr 06 2016

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

%K nonn,easy

%O 0,3

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)