|
|
A070662
|
|
a(n) = n^6 mod 39.
|
|
0
|
|
|
0, 1, 25, 27, 1, 25, 12, 25, 25, 27, 1, 25, 27, 13, 1, 12, 1, 1, 12, 25, 25, 12, 1, 1, 12, 1, 13, 27, 25, 1, 27, 25, 25, 12, 25, 1, 27, 25, 1, 0, 1, 25, 27, 1, 25, 12, 25, 25, 27, 1, 25, 27, 13, 1, 12, 1, 1, 12, 25, 25, 12, 1, 1, 12, 1, 13, 27, 25, 1, 27, 25, 25, 12, 25, 1, 27, 25
(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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
|
|
FORMULA
|
|
|
MATHEMATICA
|
PowerMod[Range[0, 80], 6, 39] (* or *) PadRight[{}, 120, {0, 1, 25, 27, 1, 25, 12, 25, 25, 27, 1, 25, 27, 13, 1, 12, 1, 1, 12, 25, 25, 12, 1, 1, 12, 1, 13, 27, 25, 1, 27, 25, 25, 12, 25, 1, 27, 25, 1}] (* Harvey P. Dale, Aug 28 2016 *)
|
|
PROG
|
(Sage) [power_mod(n, 6, 39)for n in range(0, 77)] # Zerinvary Lajos, Nov 07 2009
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|