|
|
A070481
|
|
a(n) = n^3 mod 19.
|
|
1
|
|
|
0, 1, 8, 8, 7, 11, 7, 1, 18, 7, 12, 1, 18, 12, 8, 12, 11, 11, 18, 0, 1, 8, 8, 7, 11, 7, 1, 18, 7, 12, 1, 18, 12, 8, 12, 11, 11, 18, 0, 1, 8, 8, 7, 11, 7, 1, 18, 7, 12, 1, 18, 12, 8, 12, 11, 11, 18, 0, 1, 8, 8, 7, 11, 7, 1, 18, 7, 12, 1, 18, 12, 8, 12, 11, 11, 18, 0, 1, 8, 8, 7, 11, 7, 1, 18
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
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, 1).
|
|
FORMULA
|
a(n) = a(n-19).
G.f.: (-x -8*x^2 -8*x^3 -7*x^4 -11*x^5 -7*x^6 -x^7 -18*x^8 -7*x^9 - 12*x^10 -x^11 -18*x^12 -12*x^13 -8*x^14 -12*x^15 -11*x^16 -11*x^17 - 18*x^18)/(-1 + x^19). (End)
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(n, 3, 19 )for n in range(0, 85)] # Zerinvary Lajos, Oct 29 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|