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 A036144 #12 Jan 28 2019 13:59:49 %S A036144 1,2,4,8,16,32,64,128,125,119,107,83,35,70,9,18,36,72,13,26,52,104,77, %T A036144 23,46,92,53,106,81,31,62,124,117,103,75,19,38,76,21,42,84,37,74,17, %U A036144 34,68,5,10,20,40,80,29,58,116 %N A036144 a(n) = 2^n mod 131. %D A036144 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff. %H A036144 Muniru A Asiru, <a href="/A036144/b036144.txt">Table of n, a(n) for n = 0..1000</a> %F A036144 a(n) = a(n-130). - _Muniru A Asiru_, Jan 27 2019 %p A036144 [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ]; %o A036144 (PARI) a(n)=lift(Mod(2,131)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A036144 (GAP) a:=List([0..70],n->PowerMod(2,n,131));; Print(a); # _Muniru A Asiru_, Jan 27 2019 %K A036144 nonn,easy %O A036144 0,2 %A A036144 _N. J. A. Sloane_