The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070512 a(n) = n^4 mod 7. 2

%I

%S 0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,

%T 1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,

%U 2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2

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

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

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

%F a(n) = a(n-7).

%F G.f.: x*(1 +2*x +4*x^2 +2*x^4 + x^5)/(1 - x^7).

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

%o (Sage) [power_mod(n,4,7)for n in range(0, 101)] # _Zerinvary Lajos_, Oct 30 2009

%o (MAGMA) [Modexp(n, 4, 7): n in [0..100]]; // _Vincenzo Librandi_, Apr 02 2016

%o (PARI) a(n)=n^4%7 \\ _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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 15 18:11 EDT 2021. Contains 345049 sequences. (Running on oeis4.)