This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070394 a(n) = 6^n mod 17. 1
 1, 6, 2, 12, 4, 7, 8, 14, 16, 11, 15, 5, 13, 10, 9, 3, 1, 6, 2, 12, 4, 7, 8, 14, 16, 11, 15, 5, 13, 10, 9, 3, 1, 6, 2, 12, 4, 7, 8, 14, 16, 11, 15, 5, 13, 10, 9, 3, 1, 6, 2, 12, 4, 7, 8, 14, 16, 11, 15, 5, 13, 10, 9, 3, 1, 6, 2, 12, 4, 7, 8, 14, 16, 11, 15, 5, 13, 10, 9, 3, 1, 6, 2, 12, 4, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,-1,1). [R. J. Mathar, Apr 20 2010] FORMULA From R. J. Mathar, Apr 20 2010: (Start) a(n) = a(n-1) - a(n-8) + a(n-9). G.f.: ( -1-5*x+4*x^2-10*x^3+8*x^4-3*x^5-x^6-6*x^7-3*x^8 ) / ( (x-1)*(1+x^8) ). (End) a(n) = a(n-16). - G. C. Greubel, Mar 18 2016 MATHEMATICA PowerMod[6, Range[0, 50], 17] (* G. C. Greubel, Mar 18 2016 *) PROG (Sage) [power_mod(6, n, 17)for n in xrange(0, 86)] # Zerinvary Lajos, Nov 27 2009 (PARI) a(n) = lift(Mod(6, 17)^n); \\ Altug Alkan, Mar 18 2016 CROSSREFS Sequence in context: A194351 A040035 A065272 * A065174 A065284 A050088 Adjacent sequences:  A070391 A070392 A070393 * A070395 A070396 A070397 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, May 12 2002 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 17:41 EST 2018. Contains 318049 sequences. (Running on oeis4.)