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