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 A070636 #16 Dec 26 2023 21:53:43 %S A070636 0,1,12,1,1,12,12,12,12,1,1,12,1,0,1,12,1,1,12,12,12,12,1,1,12,1,0,1, %T A070636 12,1,1,12,12,12,12,1,1,12,1,0,1,12,1,1,12,12,12,12,1,1,12,1,0,1,12,1, %U A070636 1,12,12,12,12,1,1,12,1,0,1,12,1,1,12,12,12,12,1,1,12,1,0,1,12,1,1,12 %N A070636 a(n) = n^6 mod 13. %H A070636 <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). %F A070636 a(n) = a(n-13). - _Wesley Ivan Hurt_, Dec 26 2023 %t A070636 PowerMod[Range[0,90],6,13] (* _Harvey P. Dale_, Feb 13 2011 *) %o A070636 (Sage) [power_mod(n,6,13)for n in range(0, 84)] # _Zerinvary Lajos_, Nov 06 2009 %o A070636 (PARI) a(n)=n^6%13 \\ _Charles R Greathouse IV_, Apr 06 2016 %K A070636 nonn,easy %O A070636 0,3 %A A070636 _N. J. A. Sloane_, May 13 2002