cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A070384 a(n) = 5^n mod 37.

This page as a plain text file.
%I A070384 #32 Dec 18 2023 14:17:00
%S A070384 1,5,25,14,33,17,11,18,16,6,30,2,10,13,28,29,34,22,36,32,12,23,4,20,
%T A070384 26,19,21,31,7,35,27,24,9,8,3,15,1,5,25,14,33,17,11,18,16,6,30,2,10,
%U A070384 13,28,29,34,22,36,32,12,23,4,20,26,19,21,31,7,35,27,24,9,8,3,15,1,5,25,14
%N A070384 a(n) = 5^n mod 37.
%C A070384 Period: (1, 5, 25, 14, 33, 17, 11, 18, 16, 6, 30, 2, 10, 13, 28, 29, 34, 22, 36, 32, 12, 23, 4, 20, 26, 19, 21, 31, 7, 35, 27, 24, 9, 8, 3, 15) of length 36. - _Zak Seidov_, Feb 08 2011
%H A070384 G. C. Greubel, <a href="/A070384/b070384.txt">Table of n, a(n) for n = 0..1000</a>
%H A070384 <a href="/index/Rec#order_19">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1).
%F A070384 From _R. J. Mathar_, Apr 20 2010: (Start)
%F A070384 a(n) = a(n-1) - a(n-18) + a(n-19).
%F A070384 G.f.: ( -1-4*x-20*x^2+11*x^3-19*x^4+16*x^5+6*x^6-7*x^7 +2*x^8+10*x^9 -24*x^10+28*x^11-8*x^12-3*x^13-15*x^14-x^15-5*x^16+12*x^17-15*x^18 ) / ( (x-1)*(x^2+1)*(x^4-x^2+1)*(x^12-x^6+1) ). (End)
%F A070384 a(n) = 37 - a(n-18). - _Zak Seidov_, Feb 08 2011
%F A070384 a(n) = a(n-36). - _G. C. Greubel_, Mar 16 2016
%t A070384 a[n_]:=PowerMod[5,n,37];Table[a[n],{n,72}] (* _Zak Seidov_, Feb 08 2011 *)
%o A070384 (Sage) [power_mod(5,n,37) for n in range(0,76)] # _Zerinvary Lajos_, Nov 26 2009
%o A070384 (PARI) a(n)=lift(Mod(5,37)^n) \\ _M. F. Hasler_, Feb 08 2011
%o A070384 (PARI) a(n)=5^(n%36)%37  \\ _M. F. Hasler_, Feb 08 2011
%o A070384 (Magma) [Modexp(5, n, 37): n in [0..100]]; // _Vincenzo Librandi_, Jun 29 2016
%K A070384 nonn
%O A070384 0,2
%A A070384 _N. J. A. Sloane_, May 12 2002