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 A167628 #17 Dec 07 2019 12:18:26 %S A167628 0,1,7,9,10,8,11,2,5,3,4,6,12,0,1,7,9,10,8,11,2,5,3,4,6,12,0,1,7,9,10, %T A167628 8,11,2,5,3,4,6,12,0,1,7,9,10,8,11,2,5,3,4,6,12,0,1,7,9,10,8,11,2,5,3, %U A167628 4,6,12,0,1,7,9,10,8,11,2,5,3,4,6,12,0,1,7,9,10,8,11,2,5,3,4,6,12,0,1,7,9 %N A167628 n^11 mod 13. %C A167628 Equivalently: n^(12*m+11) (mod 13). - _G. C. Greubel_, Jun 17 2016 %H A167628 Vincenzo Librandi, <a href="/A167628/b167628.txt">Table of n, a(n) for n = 0..1000</a> %F A167628 a(n+13) = a(n). - _G. C. Greubel_, Jun 17 2016 %t A167628 PowerMod[Range[0,100],11,13] (* _Harvey P. Dale_, Oct 31 2011 *) %o A167628 (Sage) [power_mod(n,11,13) for n in range(0, 95)] %o A167628 (PARI) a(n)=n^11%13 \\ _Charles R Greathouse IV_, Apr 06 2016 %K A167628 nonn,easy %O A167628 0,3 %A A167628 _Zerinvary Lajos_, Nov 07 2009