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 A070413 #34 Dec 27 2023 08:37:42 %S A070413 1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24, %T A070413 23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25,1, %U A070413 7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25,1,7,20,24,23,16,25 %N A070413 a(n) = 7^n mod 29. %H A070413 G. C. Greubel, <a href="/A070413/b070413.txt">Table of n, a(n) for n = 0..1000</a> %H A070413 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,1). %F A070413 From _R. J. Mathar_, Apr 20 2010: (Start) %F A070413 a(n) = a(n-7). %F A070413 G.f.: ( -1-7*x-20*x^2-24*x^3-23*x^4-16*x^5-25*x^6 ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6) ). (End) %t A070413 PowerMod[7, Range[0, 50], 29] (* _G. C. Greubel_, Mar 20 2016 *) %o A070413 (Sage) [power_mod(7,n,29) for n in range(0,77)] # _Zerinvary Lajos_, Nov 27 2009 %o A070413 (PARI) a(n) = lift(Mod(7, 29)^n); \\ _Altug Alkan_, Mar 20 2016 %o A070413 (Magma) [Modexp(7, n, 29): n in [0..100]]; // _Bruno Berselli_, Mar 22 2016 %K A070413 nonn,easy %O A070413 0,2 %A A070413 _N. J. A. Sloane_, May 12 2002