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.

A036127 a(n) = 5^n mod 47.

This page as a plain text file.
%I A036127 #30 Sep 08 2022 08:44:52
%S A036127 1,5,25,31,14,23,21,11,8,40,12,13,18,43,27,41,17,38,2,10,3,15,28,46,
%T A036127 42,22,16,33,24,26,36,39,7,35,34,29,4,20,6,30,9,45,37,44,32,19,1,5,25,
%U A036127 31,14,23,21,11,8,40,12,13,18,43
%N A036127 a(n) = 5^n mod 47.
%D A036127 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
%H A036127 G. C. Greubel, <a href="/A036127/b036127.txt">Table of n, a(n) for n = 0..10000</a>
%H A036127 <a href="/index/Rec#order_24">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,0,0,0,0,0,-1,1).
%F A036127 a(n) = (n-46). - _Vincenzo Librandi_, Feb 07 2011
%F A036127 a(n) = a(n-1) - a(n-23) + a(n-24). - _R. J. Mathar_, Jun 04 2016
%F A036127 a(n) = 47 - a(n+23) for all n in Z. - _Michael Somos_, Oct 17 2018
%p A036127 [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ];
%t A036127 Mod[5^Range[0,100],47]  (* _Harvey P. Dale_, Mar 09 2011 *)
%o A036127 (PARI) a(n)=lift(Mod(5,47)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%o A036127 (Magma) [Modexp(5, n, 47): n in [0..100]]; // _G. C. Greubel_, Oct 18 2018
%o A036127 (GAP) List([0..60],n->PowerMod(5,n,47)); # _Muniru A Asiru_, Oct 18 2018
%Y A036127 Cf. A000351 (5^n).
%K A036127 nonn,easy
%O A036127 0,2
%A A036127 _N. J. A. Sloane_