login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


a(n) = 5^n mod 34.
1

%I #36 Dec 07 2019 12:18:23

%S 1,5,25,23,13,31,19,27,33,29,9,11,21,3,15,7,1,5,25,23,13,31,19,27,33,

%T 29,9,11,21,3,15,7,1,5,25,23,13,31,19,27,33,29,9,11,21,3,15,7,1,5,25,

%U 23,13,31,19,27,33,29,9,11,21,3,15,7,1,5,25,23,13,31,19,27,33,29,9,11

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

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

%H <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,-1,1). [_R. J. Mathar_, Apr 20 2010]

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

%F a(n) = a(n-1) - a(n-8) + a(n-9).

%F G.f.: ( -1-4*x-20*x^2+2*x^3+10*x^4-18*x^5+12*x^6-8*x^7-7*x^8 ) / ( (x-1)*(1+x^8) ). (End)

%F a(n) = a(n-16). - _G. C. Greubel_, Mar 16 2016

%t Mod[5^Range[0,100],34] (* _Harvey P. Dale_, Mar 01 2011 *)

%t PowerMod[5,Range[0,100],34] (* or *) PadRight[{},120,{1,5,25,23,13,31,19,27,33,29,9,11,21,3,15,7}] (* _Harvey P. Dale_, May 03 2018 *)

%o (Sage) [power_mod(5,n,34) for n in range(0,76)] # _Zerinvary Lajos_, Nov 26 2009

%o (PARI) a(n) = lift(Mod(5, 34)^n); \\ _Altug Alkan_, Mar 16 2016

%K nonn

%O 0,2

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 19:55 EDT 2024. Contains 376138 sequences. (Running on oeis4.)