|
|
A070486
|
|
a(n) = n^3 mod 24 (or equivalently, n^5 mod 24).
|
|
2
|
|
|
0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13, 8, 15, 16, 17, 0, 19, 8, 21, 16, 23, 0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13, 8, 15, 16, 17, 0, 19, 8, 21, 16, 23, 0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13, 8, 15, 16, 17, 0, 19, 8, 21, 16, 23, 0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Equivalent: n^(2m+3) mod 24, m>=1, m being an integer. - G. C. Greubel, Mar 30 2016
|
|
LINKS
|
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,0,0,0,1).
|
|
FORMULA
|
|
|
MATHEMATICA
|
PowerMod[Range[0, 100], 3, 24] (* or *) PadRight[{}, 100, {0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13, 8, 15, 16, 17, 0, 19, 8, 21, 16, 23}] (* Harvey P. Dale, Jul 26 2015 *)
|
|
PROG
|
(Sage) [power_mod(n, 3, 24) for n in range(0, 86)] # Zerinvary Lajos, Oct 29 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|