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 A036159 #19 Jan 27 2019 07:55:02 %S A036159 1,2,4,8,16,32,64,128,45,90,180,149,87,174,137,63,126,41,82,164,117, %T A036159 23,46,92,184,157,103,206,201,191,171,131,51,102,204,197,183,155,99, %U A036159 198,185,159,107,3,6,12,24,48,96 %N A036159 a(n) = 2^n mod 211. %D A036159 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff. %H A036159 Muniru A Asiru, <a href="/A036159/b036159.txt">Table of n, a(n) for n = 0..1000</a> %F A036159 a(n) = a(n-210). - _Muniru A Asiru_, Jan 27 2019 %p A036159 [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ]; %t A036159 PowerMod[2,Range[0,50],211] (* _Harvey P. Dale_, Apr 18 2016 *) %o A036159 (PARI) a(n)=lift(Mod(2,211)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A036159 (GAP) a:=List([0..70],n->PowerMod(2,n,211));; Print(a); # _Muniru A Asiru_, Jan 26 2019 %K A036159 nonn,easy %O A036159 0,2 %A A036159 _N. J. A. Sloane_