|
|
A070478
|
|
a(n) = n^3 mod 16.
|
|
1
|
|
|
0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
|
|
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, 1).
|
|
FORMULA
|
a(n) = a(n-16).
G.f.: (-x -8*x^2 -11*x^3 -13*x^5 -8*x^6 -7*x^7 -9*x^9 -8*x^10 -3*x^11 -5*x^13 -8*x^14 -15*x^15)/(-1 + x^16). (End)
|
|
MATHEMATICA
|
Table[Mod[n^3, 16], {n, 0, 100}] (* G. C. Greubel, Mar 28 2016 *)
|
|
PROG
|
(Sage) [power_mod(n, 3, 16) for n in range(0, 96)] # Zerinvary Lajos, Oct 28 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|