This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070341 a(n) = 3^n mod 11: Repeat (1, 3, 9, 5, 4), period 5. 6
 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9, 5, 4, 1, 3, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Simple continued fraction expansion of 13/24 + sqrt(8761)/120 = 1.3216684472... - R. J. Mathar, Mar 08 2012 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, 1). FORMULA a(n) = (1/25)*{26*(n mod 5)+16*[(n+1) mod 5]+31*[(n+2) mod 5]-19*[(n+3) mod 5]+[(n+4) mod 5]}, with n>=0. - Paolo P. Lava, Feb 25 2010 From R. J. Mathar, Apr 13 2010: (Start) a(n) = a(n-5). G.f.: (1+3*x+9*x^2+5*x^3+4*x^4)/ ((1-x) * (1+x+x^2+x^3+x^4)). (End) MATHEMATICA PowerMod[3, Range[0, 100], 11] (* or *) PadRight[{}, 100, {1, 3, 9, 5, 4}] (* Harvey P. Dale, Feb 05 2012 *) PROG (Sage) [power_mod(3, n, 11)for n in xrange(0, 93)] # Zerinvary Lajos, Nov 24 2009 (PARI) a(n)=lift(Mod(3, 11)^n) (PARI) a(n)=[1, 3, 9, 5, 4][n%5+1]  \\ M. F. Hasler, Mar 04 2011 CROSSREFS Sequence in context: A265272 A021257 A282529 * A245719 A085851 A212321 Adjacent sequences:  A070338 A070339 A070340 * A070342 A070343 A070344 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 25 09:48 EDT 2019. Contains 324347 sequences. (Running on oeis4.)