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
(SageMath) [power_mod(n, 4, 24)for n in range(0, 90)] # - Zerinvary Lajos, Oct 31 2009
(SageMath) [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
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved
