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 A036153 #14 Jan 28 2019 13:59:26 %S A036153 1,2,4,8,16,32,64,128,77,154,129,79,158,137,95,11,22,44,88,176,173, %T A036153 167,155,131,83,166,153,127,75,150,121,63,126,73,146,113,47,94,9,18, %U A036153 36,72,144,109,39,78,156,133,87,174 %N A036153 a(n) = 2^n mod 179. %D A036153 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff. %H A036153 Muniru A Asiru, <a href="/A036153/b036153.txt">Table of n, a(n) for n = 0..1000</a> %F A036153 a(n) = a(n-178). - _Muniru A Asiru_, Jan 27 2019 %p A036153 [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ]; %t A036153 PowerMod[2,Range[0,90],179] (* _Harvey P. Dale_, Jul 31 2018 *) %o A036153 (PARI) a(n)=lift(Mod(2,179)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A036153 (GAP) a:=List([0..70],n->PowerMod(2,n,179));; Print(a); # _Muniru A Asiru_, Jan 27 2019 %K A036153 nonn,easy %O A036153 0,2 %A A036153 _N. J. A. Sloane_