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.
%I A070379 #30 Sep 08 2022 08:45:05 %S A070379 1,5,25,9,16,22,23,28,24,4,20,13,7,6,1,5,25,9,16,22,23,28,24,4,20,13, %T A070379 7,6,1,5,25,9,16,22,23,28,24,4,20,13,7,6,1,5,25,9,16,22,23,28,24,4,20, %U A070379 13,7,6,1,5,25,9,16,22,23,28,24,4,20,13,7,6,1,5,25,9,16,22,23,28,24,4,20 %N A070379 a(n) = 5^n mod 29. %H A070379 G. C. Greubel, <a href="/A070379/b070379.txt">Table of n, a(n) for n = 0..1000</a> %H A070379 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,-1,1). %F A070379 From _R. J. Mathar_, Apr 20 2010: (Start) %F A070379 a(n) = a(n-1) - a(n-7) + a(n-8). %F A070379 G.f.: ( -1-4*x-20*x^2+16*x^3-7*x^4-6*x^5-x^6-6*x^7 ) / ( (x-1)*(1+x)*(x^6-x^5+x^4-x^3+x^2-x+1) ). (End) %F A070379 a(n) = a(n-14). - _G. C. Greubel_, Mar 16 2016 %t A070379 PowerMod[5,Range[0,90],29] (* _Harvey P. Dale_, Nov 13 2011 *) %o A070379 (Sage) [power_mod(5,n,29) for n in range(0,81)] # _Zerinvary Lajos_, Nov 26 2009 %o A070379 (PARI) a(n)=lift(Mod(5,29)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A070379 (Magma) [Modexp(5, n, 29): n in [0..100]]; // _Bruno Berselli_, Mar 23 2016 %K A070379 nonn,easy %O A070379 0,2 %A A070379 _N. J. A. Sloane_, May 12 2002