cp's OEIS Frontend

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.

A036154 a(n) = 2^n mod 181.

This page as a plain text file.
%I A036154 #16 Jan 27 2019 10:42:13
%S A036154 1,2,4,8,16,32,64,128,75,150,119,57,114,47,94,7,14,28,56,112,43,86,
%T A036154 172,163,145,109,37,74,148,115,49,98,15,30,60,120,59,118,55,110,39,78,
%U A036154 156,131,81,162,143,105,29,58,116
%N A036154 a(n) = 2^n mod 181.
%D A036154 I. M. Vinogradov, Elements of Number Theory, pp. 220 ff.
%H A036154 Muniru A Asiru, <a href="/A036154/b036154.txt">Table of n, a(n) for n = 0..1000</a>
%F A036154 a(n) = a(n-180). - _Muniru A Asiru_, Jan 27 2019
%p A036154 [ seq(primroot(ithprime(i))^j mod ithprime(i),j=0..100) ];
%o A036154 (PARI) a(n)=lift(Mod(2,181)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%o A036154 (GAP) a:=List([0..70],n->PowerMod(2,n,181));; Print(a); # _Muniru A Asiru_, Jan 26 2019
%K A036154 nonn,easy
%O A036154 0,2
%A A036154 _N. J. A. Sloane_