|
|
A070502
|
|
a(n) = n^3 mod 40.
|
|
2
|
|
|
0, 1, 8, 27, 24, 5, 16, 23, 32, 9, 0, 11, 8, 37, 24, 15, 16, 33, 32, 19, 0, 21, 8, 7, 24, 25, 16, 3, 32, 29, 0, 31, 8, 17, 24, 35, 16, 13, 32, 39, 0, 1, 8, 27, 24, 5, 16, 23, 32, 9, 0, 11, 8, 37, 24, 15, 16, 33, 32, 19, 0, 21, 8, 7, 24, 25, 16, 3, 32, 29, 0, 31, 8, 17, 24, 35, 16
(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, 0, 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
|
a(n+40) = a(n). If n even, a(n+20) = a(n). - R. J. Mathar, Sep 25 2008
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [power_mod(n, 3, 40 )for n in range(0, 77)] # Zerinvary Lajos, Oct 30 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|