|
|
A070533
|
|
a(n) = n^4 mod 15.
|
|
1
|
|
|
0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
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, 1).
|
|
FORMULA
|
a(15*n) = 0.
a(n+15) = a(n). (End)
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(n, 4, 15)for n in range(0, 97)] # Zerinvary Lajos, Oct 31 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|