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

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

%I

%S 0,1,16,18,4,16,15,7,1,9,4,4,9,1,7,15,16,4,18,16,1,0,1,16,18,4,16,15,

%T 7,1,9,4,4,9,1,7,15,16,4,18,16,1,0,1,16,18,4,16,15,7,1,9,4,4,9,1,7,15,

%U 16,4,18,16,1,0,1,16,18,4,16,15,7,1,9,4,4,9,1,7,15,16,4,18,16,1,0,1,16,18

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

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

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

%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, 21] (* _G. C. Greubel_, Apr 05 2016 *)

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

%o (PARI) a(n)=n^4%21 \\ _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.

Last modified August 7 23:50 EDT 2022. Contains 355995 sequences. (Running on oeis4.)