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!)
 A070407 a(n) = 7^n mod 17. 2
 1, 7, 15, 3, 4, 11, 9, 12, 16, 10, 2, 14, 13, 6, 8, 5, 1, 7, 15, 3, 4, 11, 9, 12, 16, 10, 2, 14, 13, 6, 8, 5, 1, 7, 15, 3, 4, 11, 9, 12, 16, 10, 2, 14, 13, 6, 8, 5, 1, 7, 15, 3, 4, 11, 9, 12, 16, 10, 2, 14, 13, 6, 8, 5, 1, 7, 15, 3, 4, 11, 9, 12, 16, 10, 2, 14, 13, 6, 8, 5, 1, 7, 15, 3, 4, 11 (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). FORMULA From R. J. Mathar, Apr 20 2010: (Start) a(n) = a(n-1) - a(n-8) + a(n-9). G.f.: ( -1-6*x-8*x^2+12*x^3-x^4-7*x^5+2*x^6-3*x^7-5*x^8 ) / ( (x-1)*(1+x^8) ). (End) a(n) = a(n-16). - G. C. Greubel, Mar 20 2016 MATHEMATICA PowerMod[7, Range[0, 100], 17]  (* Harvey P. Dale, Mar 20 2011 *) PROG (Sage) [power_mod(7, n, 17) for n in xrange(0, 86)] # Zerinvary Lajos, Nov 27 2009 (PARI) a(n) = lift(Mod(7, 17)^n); \\ Altug Alkan, Mar 20 2016 (MAGMA) [Modexp(7, n, 17): n in [0..100]]; // Bruno Berselli, Mar 22 2016 CROSSREFS Sequence in context: A061522 A213151 A225763 * A069841 A289940 A290065 Adjacent sequences:  A070404 A070405 A070406 * A070408 A070409 A070410 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.