The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070419 a(n) = 7^n mod 36. 1
 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31, 1, 7, 13, 19, 25, 31 (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 (0,0,0,0,0,1). [R. J. Mathar, Apr 20 2010] FORMULA From R. J. Mathar, Apr 20 2010: (Start) a(n) = a(n-6). G.f.: ( -1-7*x-13*x^2-19*x^3-25*x^4-31*x^5 ) / ( (x-1)*(1+x)*(1+x+x^2)*(x^2-x+1) ). (End) MATHEMATICA PowerMod[7, Range[0, 50], 36] (* G. C. Greubel, Mar 20 2016 *) PROG (Sage) [power_mod(7, n, 36) for n in range(0, 78)] # Zerinvary Lajos, Nov 27 2009 (PARI) a(n) = lift(Mod(7, 36)^n); \\ Altug Alkan, Mar 20 2016 (MAGMA) [Modexp(7, n, 36): n in [0..100]]; // Bruno Berselli, Mar 22 2016 CROSSREFS Sequence in context: A035497 A216527 A059335 * A080199 A016921 A331425 Adjacent sequences:  A070416 A070417 A070418 * A070420 A070421 A070422 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 June 15 11:06 EDT 2021. Contains 345048 sequences. (Running on oeis4.)