|
|
A070532
|
|
a(n) = n^4 mod 14.
|
|
1
|
|
|
0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2
(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, 1).
|
|
FORMULA
|
a(n+14) = a(n).
a(14*m) = 0.
G.f.: (x +2*x^2 +11*x^3 +4*x^4 +9*x^5 +8*x^6 +7*x^7 +8*x^8 +9*x^9 +4*x^10 +11*x^11 +2*x^12 +x^13)/(1 - x^14). (End)
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(n, 4, 14)for n in range(0, 97)] # Zerinvary Lajos, Oct 31 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|