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 A132143 #14 Jan 14 2019 18:26:25
%S A132143 3,5,7,11,13,17,19,29,31,41,43,47,59,61,71,73,79,83,89,97,101,103,109,
%T A132143 113,127,131,139,149,151,157,167,173,179,181,191,197,199,211,223,227,
%U A132143 229,239,241,251,257,269,271,281,283,293,307,311,313,331,337,349,353
%N A132143 Prime numbers P such that (P^k-2) is not divisible by 35(=A119691(1)) for any value of k.
%C A132143 Primes not congruent to 2, 18, 23, or 32 (mod 35). - _Robert Israel_, Jan 14 2019
%D A132143 A. K. Devaraj, "Euler's Generalization of Fermat's Theorem-A Further Generalization", in ISSN #1550-3747, Proceedings of Hawaii Intl Conference on Statistics, Mathematics & Related Fields, 2004.
%H A132143 Robert Israel, <a href="/A132143/b132143.txt">Table of n, a(n) for n = 1..10000</a>
%p A132143 G:= sort(convert(map(proc(t) if t::even then t+35 else t fi end proc, {$0..34} minus {2,18,23,32}),list)):
%p A132143 select(isprime, [seq(seq(70*i+j,j=G),i=0..10)]); # _Robert Israel_, Jan 14 2019
%o A132143 (PARI) forprime(p=1, 353, if(#setintersect([p%35], [2, 18, 23, 32])==0, print1(p, ", "))) \\ _Felix Fröhlich_, Jan 14 2019
%K A132143 nonn,less
%O A132143 1,1
%A A132143 _A.K. Devaraj_, Aug 12 2007
%E A132143 Terms beyond 41 from _R. J. Mathar_, Mar 01 2010