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 A036147 #16 Aug 10 2025 12:35:02 %S A036147 1,2,4,8,16,32,64,128,107,65,130,111,73,146,143,137,125,101,53,106,63, %T A036147 126,103,57,114,79,9,18,36,72,144,139,129,109,69,138,127,105,61,122, %U A036147 95,41,82,15,30,60,120,91,33 %N A036147 a(n) = 2^n mod 149. %D A036147 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff. %H A036147 Muniru A Asiru, <a href="/A036147/b036147.txt">Table of n, a(n) for n = 0..1000</a> %F A036147 a(n) = a(n-148). - _Muniru A Asiru_, Jan 27 2019 %p A036147 [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ]; %t A036147 PowerMod[2,Range[0,50],149] (* _Harvey P. Dale_, Aug 10 2025 *) %o A036147 (PARI) a(n)=lift(Mod(2,149)^n) \\ _Charles R Greathouse IV_, Mar 22 2016 %o A036147 (GAP) a:=List([0..70],n->PowerMod(2,n,149));; Print(a); # _Muniru A Asiru_, Jan 27 2019 %K A036147 nonn,easy %O A036147 0,2 %A A036147 _N. J. A. Sloane_