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
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Equivalently: n^(6*m + 4) mod 21. - G. C. Greubel, Apr 05 2016 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). FORMULA From G. C. Greubel, Apr 05 2016: (Start) a(21*n) = 0. a(n+21) = a(n). (End) MATHEMATICA PowerMod[Range[0, 100], 4, 21] (* G. C. Greubel, Apr 05 2016 *) PROG (Sage) [power_mod(n, 4, 21)for n in range(0, 88)] # Zerinvary Lajos, Oct 31 2009 (PARI) a(n)=n^4%21 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Sequence in context: A041542 A030046 A002925 * A341271 A358677 A085096 Adjacent sequences: A070537 A070538 A070539 * A070541 A070542 A070543 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 16 22:04 EDT 2024. Contains 375979 sequences. (Running on oeis4.)