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 A070425 #33 Dec 14 2023 05:06:38 %S A070425 1,7,6,42,36,37,1,7,6,42,36,37,1,7,6,42,36,37,1,7,6,42,36,37,1,7,6,42, %T A070425 36,37,1,7,6,42,36,37,1,7,6,42,36,37,1,7,6,42,36,37,1,7,6,42,36,37,1, %U A070425 7,6,42,36,37,1,7,6,42,36,37,1,7,6,42,36,37,1,7,6,42,36,37,1,7,6,42,36 %N A070425 a(n) = 7^n mod 43. %C A070425 Sequence is periodic with length 6. Since a(21) = 42 (or -1), 43 is prime in Z[sqrt(7)]. - _Alonso del Arte_, Oct 12 2012 %H A070425 G. C. Greubel, <a href="/A070425/b070425.txt">Table of n, a(n) for n = 0..1000</a> %H A070425 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,-1,1). %F A070425 From _R. J. Mathar_, Apr 20 2010: (Start) %F A070425 a(n) = a(n - 1) - a(n - 3) + a(n - 4). %F A070425 G..f: ( -1 - 6*x + x^2 - 37*x^3 ) / ( (x - 1)*(1 + x)*(x^2 - x + 1) ). (End) %F A070425 a(n) = a(n-6). - _G. C. Greubel_, Mar 22 2016 %t A070425 PowerMod[7, Range[0, 74], 43] (* _Alonso del Arte_, Oct 12 2012 *) %o A070425 (Sage) [power_mod(7,n,43) for n in range(0,83)] # _Zerinvary Lajos_, Nov 27 2009 %o A070425 (PARI) a(n)=lift(Mod(7,43)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A070425 (Magma) [Modexp(7, n, 43): n in [0..100]]; // _Bruno Berselli_, Mar 22 2016 %K A070425 nonn,easy %O A070425 0,2 %A A070425 _N. J. A. Sloane_, May 12 2002