This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A001218 a(n) = 3^n mod 100. 4
 1, 3, 9, 27, 81, 43, 29, 87, 61, 83, 49, 47, 41, 23, 69, 7, 21, 63, 89, 67, 1, 3, 9, 27, 81, 43, 29, 87, 61, 83, 49, 47, 41, 23, 69, 7, 21, 63, 89, 67, 1, 3, 9, 27, 81, 43, 29, 87, 61, 83, 49, 47, 41, 23, 69, 7, 21, 63, 89, 67 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Period is 20. LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 MATHEMATICA PowerMod[3, Range[0, 60], 100] (* Vincenzo Librandi, Aug 15 2016 PROG (PARI) a(n)=lift(Mod(3, 100)^n) \\ Charles R Greathouse IV, Dec 27 2012 (MAGMA) [Modexp(3, n, 100): n in [0..100]]; // Vincenzo Librandi, Aug 15 2016 CROSSREFS Cf. A001148, A216096, A216097. - Zak Seidov, Jul 27 2014 Sequence in context: A036142 A036160 A271352 * A036158 A036136 A271350 Adjacent sequences:  A001215 A001216 A001217 * A001219 A001220 A001221 KEYWORD nonn,easy AUTHOR EXTENSIONS Definition corrected by Zak Seidov, Jul 27 2014 STATUS approved

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

Last modified December 16 01:36 EST 2017. Contains 296063 sequences.