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 A036152 #20 Jan 27 2019 10:57:39 %S A036152 1,2,4,8,16,32,64,128,83,166,159,145,117,61,122,71,142,111,49,98,23, %T A036152 46,92,11,22,44,88,3,6,12,24,48,96,19,38,76,152,131,89,5,10,20,40,80, %U A036152 160,147,121,69,138,103,33,66,132,91,9,18,36,72,144,115,57,114,55,110,47,94 %N A036152 a(n) = 2^n mod 173. %D A036152 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff. %H A036152 Muniru A Asiru, <a href="/A036152/b036152.txt">Table of n, a(n) for n = 0..1000</a> %F A036152 a(n) = a(n-172). - _Muniru A Asiru_, Jan 27 2019 %p A036152 [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ]; %t A036152 PowerMod[2,Range[0,80],173] (* _Harvey P. Dale_, Mar 22 2011 *) %o A036152 (PARI) a(n)=lift(Mod(2,173)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A036152 (GAP) a:=List([0..70],n->PowerMod(2,n,173));; Print(a); # _Muniru A Asiru_, Jan 27 2019 %K A036152 nonn,easy %O A036152 0,2 %A A036152 _N. J. A. Sloane_