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

%I

%S 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,

%T 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,

%U 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

%N a(n) = 3^n mod 11: Repeat (1, 3, 9, 5, 4), period 5.

%C Simple continued fraction expansion of 13/24 + sqrt(8761)/120 = 1.3216684472... - _R. J. Mathar_, Mar 08 2012

%H G. C. Greubel, <a href="/A070341/b070341.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 1).

%F 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

%F From _R. J. Mathar_, Apr 13 2010: (Start)

%F a(n) = a(n-5).

%F 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)

%t PowerMod[3,Range[0,100],11] (* or *) PadRight[{},100,{1,3,9,5,4}] (* _Harvey P. Dale_, Feb 05 2012 *)

%o (Sage) [power_mod(3, n, 11)for n in xrange(0, 93)] # _Zerinvary Lajos_, Nov 24 2009

%o (PARI) a(n)=lift(Mod(3,11)^n)

%o (PARI) a(n)=[1, 3, 9, 5, 4][n%5+1] \\ _M. F. Hasler_, Mar 04 2011

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, May 12 2002

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 July 19 11:12 EDT 2019. Contains 325158 sequences. (Running on oeis4.)