login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216096 a(n) = 3^n mod 1000. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Period = 100.
LINKS
V. Raman and Vincenzo Librandi, Table of n, a(n) for n = 0..1000 (first 100 terms from V. Raman)
MATHEMATICA
PowerMod[3, Range[0, 100], 1000] (* Vincenzo Librandi, Aug 16 2016 *)
PROG
(PARI) a(n) = lift(Mod(3, 1000)^n); \\ Michel Marcus, Aug 16 2016
(Magma) [Modexp(3, n, 1000): n in [0..110]]; // Vincenzo Librandi, Aug 16 2016
CROSSREFS
Sequence in context: A038002 A272338 A249019 * A300148 A190128 A216097
KEYWORD
nonn,easy
AUTHOR
V. Raman, Sep 01 2012
EXTENSIONS
Definition corrected by Zak Seidov, Jul 27 2014
Offset changed and a(0) = 1 prepended by Vincenzo Librandi, Aug 16 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 18 21:02 EDT 2024. Contains 374388 sequences. (Running on oeis4.)