OFFSET
0,2
REFERENCES
I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (1,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,1).
FORMULA
a(n) = a(n+66). - R. J. Mathar, Jun 04 2016
a(n) = a(n-1) - a(n-33) + a(n-34). - G. C. Greubel, Oct 17 2018
EXAMPLE
As 2^10 = 1024 = 67 * k + 19 for some k and 0 <= 19 < 67, a(10) = 19. - David A. Corneth, Oct 17 2018
MAPLE
[ seq(primroot(ithprime(i))^j mod ithprime(i), j=0..100) ];
MATHEMATICA
PowerMod[2, Range[0, 100], 67] (* G. C. Greubel, Oct 17 2018 *)
PROG
(PARI) a(n)=lift(Mod(2, 67)^n) \\ Charles R Greathouse IV, Mar 22 2016
(Magma) [Modexp(2, n, 67): n in [0..100]]; // G. C. Greubel, Oct 17 2018
(Python) for n in range(0, 100): print(int(pow(2, n, 67)), end=' ') # Stefano Spezia, Oct 17 2018
(GAP) List([0..60], n->PowerMod(2, n, 67)); # Muniru A Asiru, Oct 17 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved