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 A206786 #30 Jun 04 2017 09:06:54
%S A206786 1,1,56,1,67,56,56,1,67,67,253,56,67,56,1,1,56,67,56,67,67,253,1,56,
%T A206786 56,67,1,56,1,1,155,1,187,56,1,67,56,56,1,67,67,67,56,253,56,1,1,56,
%U A206786 67,56,67,67,67,1,242,56,67,1,56,1,1,155,1,1,56,187,67
%N A206786 Remainder of n^340 divided by 341.
%C A206786 The n for which a(n) = 1 indicate the bases to which 341 is a Fermat pseudoprime. 341 is the smallest base 2 Fermat pseudoprime.
%C A206786 The only a(n) that occur are 0, 1, 56, 67, 155, 187, 242, 253. If n is one of these eight numbers, then a(n) = n.
%C A206786 Periodic with period 341. - _Charles R Greathouse IV_, May 01 2012
%D A206786 David Wells, Prime Numbers: The Most Mysterious Figures in Math. Hoboken, New Jersey: John Wiley & Sons (2005): 191
%H A206786 <a href="/index/Rec#order_341">Index entries for linear recurrences with constant coefficients</a>, order 341.
%e A206786 a(2) = 1 because 2^340/341 leaves a remainder of 1 (the prime factors of 2^340 - 1 include 11 and 31).
%e A206786 a(3) = 56 because 3^340/341 leaves a remainder of 56 (the prime factors of 3^340 - 56 are 5, 11, 31 and a prime number with more than a hundred digits).
%t A206786 Table[Mod[n^340, 341], {n, 100}]
%t A206786 PowerMod[Range[80],340,341] (* _Harvey P. Dale_, Jun 04 2017 *)
%o A206786 (PARI) a(n)=lift(Mod(n,341)^340) \\ _Charles R Greathouse IV_, May 01 2012
%Y A206786 Cf. A200146, A066340, A230579.
%K A206786 nonn,easy
%O A206786 1,3
%A A206786 _Alonso del Arte_, Feb 12 2012