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!)
 A070367 a(n) = 5^n mod 11. 5

%I

%S 1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,

%T 9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,

%U 4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1,5,3,4,9,1

%N a(n) = 5^n mod 11.

%C Period 5: repeat [1, 5, 3, 4, 9].

%H G. C. Greubel, <a href="/A070367/b070367.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)*{51*(n mod 5)-14*[(n+1) mod 5]+6*[(n+2) mod 5]+21*[(n+3) mod 5]-9*[(n+4) mod 5]}, with n>=0. - _Paolo P. Lava_, Feb 24 2010

%F From _R. J. Mathar_, Apr 20 2010

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

%F G.f.: ( -1-5*x-3*x^2-4*x^3-9*x^4 ) / ( (x-1)*(1+x+x^2+x^3+x^4) ). (End)

%t Table[Mod[5^n, 11], {n, 0, 100}] (* _G. C. Greubel_, Mar 05 2016 *)

%o (Sage) [power_mod(5,n,11)for n in range(0,101)] # _Zerinvary Lajos_, Nov 25 2009

%o (MAGMA) &cat[[1,5,3,4,9]^^20]; // _Vincenzo Librandi_, Mar 06 2016

%o (PARI) a(n)=lift(Mod(5,11)^n) \\ _Charles R Greathouse IV_, Mar 22 2016

%Y Cf. A000351.

%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 June 1 19:32 EDT 2020. Contains 334762 sequences. (Running on oeis4.)