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 A070512 #20 Apr 25 2024 09:15:19 %S A070512 0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2, %T A070512 1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4, %U A070512 2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2,4,4,2,1,0,1,2 %N A070512 a(n) = n^4 mod 7. %C A070512 Equivalently: n^(4*m + 4) mod 7. - _G. C. Greubel_, Apr 01 2016 %H A070512 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 1). %F A070512 From _G. C. Greubel_, Apr 01 2016: (Start) %F A070512 a(n) = a(n-7). %F A070512 G.f.: x*(1 +2*x +4*x^2 +2*x^4 + x^5)/(1 - x^7). (End) %t A070512 PowerMod[Range[0, 100], 4, 7] (* _G. C. Greubel_, Apr 01 2016 *) %o A070512 (Sage) [power_mod(n,4,7)for n in range(0, 101)] # _Zerinvary Lajos_, Oct 30 2009 %o A070512 (Magma) [Modexp(n, 4, 7): n in [0..100]]; // _Vincenzo Librandi_, Apr 02 2016 %o A070512 (PARI) a(n)=n^4%7 \\ _Charles R Greathouse IV_, Apr 06 2016 %K A070512 nonn,easy %O A070512 0,3 %A A070512 _N. J. A. Sloane_, May 13 2002