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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070567 a(n) = n^4 mod 24. 1
 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1, 0, 1, 16, 9, 16, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Equivalently n^6 mod 24. - Zerinvary Lajos, Nov 06 2009 Equivalently: n^(3*m + 4) mod 24. - G. C. Greubel, Apr 07 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, 1). FORMULA From G. C. Greubel, Apr 07 2016: (Start) a(n+6) = a(n). a(6*m) = 0. a(n) mod 4 = A000035(n). G.f.: (x +16*x^2 +9*x^3 +16*x^4 +x^5)/(1 - x^6). (End) MATHEMATICA PowerMod[Range[0, 90], 4, 24] (* or *) PadRight[{}, 90, {0, 1, 16, 9, 16, 1}] (* Harvey P. Dale, Apr 07 2013 *) PROG (Sage) [power_mod(n, 4, 24)for n in range(0, 90)] # - Zerinvary Lajos, Oct 31 2009 (Sage) [power_mod(n, 6, 24)for n in range(0, 90)] # - Zerinvary Lajos, Nov 06 2009 (PARI) a(n)=n^4%24 \\ Charles R Greathouse IV, Apr 06 2016 (Magma) [Modexp(n, 4, 24): n in [0..100]]; // Vincenzo Librandi, Apr 08 2016 CROSSREFS Sequence in context: A066905 A302683 A302518 * A257796 A070688 A281719 Adjacent sequences: A070564 A070565 A070566 * A070568 A070569 A070570 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 June 23 05:53 EDT 2024. Contains 373629 sequences. (Running on oeis4.)