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!)
 A070515 a(n) = n^4 mod 11. 1
 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Equivalently: n^(10*m + 4) mod 11. - G. C. Greubel, Apr 01 2016 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 FORMULA From G. C. Greubel, Apr 01 2016: (Start) a(n) = a(n-11). a(11*m) = 0. G.f.: (x +5*x^2 +4*x^3 +3*x^4 +9*x^5 +9*x^6 +3*x^7 +4*x^8 +5*x^9 +x^10)/(1 - x^11). (End) MATHEMATICA PowerMod[Range[0, 100], 4, 11] (* Harvey P. Dale, Oct 20 2013 *) PROG (Sage) [power_mod(n, 4, 11)for n in range(0, 101)] # Zerinvary Lajos, Oct 31 2009 (MAGMA) [Modexp(n, 4, 11): n in [0..100]]; // Vincenzo Librandi, Apr 02 2016 (PARI) a(n)=n^4%11 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Sequence in context: A194556 A154198 A086793 * A096733 A125900 A019102 Adjacent sequences:  A070512 A070513 A070514 * A070516 A070517 A070518 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, May 13 2002 STATUS approved

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 17 13:43 EDT 2021. Contains 345080 sequences. (Running on oeis4.)