A216096 a(n) = 3^n mod 1000.

1, 3, 9, 27, 81, 243, 729, 187, 561, 683, 49, 147, 441, 323, 969, 907, 721, 163, 489, 467, 401, 203, 609, 827, 481, 443, 329, 987, 961, 883, 649, 947, 841, 523, 569, 707, 121, 363, 89, 267, 801, 403, 209, 627, 881, 643, 929, 787, 361, 83, 249, 747, 241, 723, 169, 507, 521, 563, 689

Offset: 0

Author

V. Raman, Sep 01 2012

Keywords

• nonn
• easy

Comments

Period = 100.

Links

• V. Raman and Vincenzo Librandi, Table of n, a(n) for n = 0..1000 (first 100 terms from V. Raman)
• Index entries for linear recurrences with constant coefficients, order 100.

Crossrefs

Cf. A001148, A001218, A216097.

Programs

Magma

[Modexp(3, n, 1000): n in [0..110]]; // Vincenzo Librandi, Aug 16 2016

Mathematica

PowerMod[3, Range[0, 100], 1000] (* Vincenzo Librandi, Aug 16 2016 *)

PARI

a(n) = lift(Mod(3, 1000)^n); \\ Michel Marcus, Aug 16 2016

Extensions

Definition corrected by Zak Seidov, Jul 27 2014

Offset changed and a(0) = 1 prepended by Vincenzo Librandi, Aug 16 2016