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 A080747 #12 Aug 23 2018 02:12:50
%S A080747 561,645,1105,1729,1905,2465,2821,4371,6601,8481,8911,10585,11305,
%T A080747 12801,13741,13981,15841,16705,18705,23001,25761,29341,30121,30889,
%U A080747 33153,34945,39865,41041,41665,46657,52633,55245,57421,62745,63973,68101,72885,74665,75361
%N A080747 Sarrus numbers with more than 2 distinct prime factors.
%H A080747 Giovanni Resta, <a href="/A080747/b080747.txt">Table of n, a(n) for n = 1..10000</a>
%p A080747 for n from 1 to 60000 do if not isprime(n) and modp(2^(n-1),n)=1 and nops(ifactors(n)[2])>2 then printf("%d, ",n) fi od: # C. Ronaldo
%t A080747 Select[Range[76000], PowerMod[2, #-1, #] == 1 && PrimeNu[#] > 2 &] (* _Giovanni Resta_, Aug 20 2018 *)
%Y A080747 Cf. A001567.
%K A080747 nonn
%O A080747 1,1
%A A080747 _Benoit Cloitre_, Mar 08 2003
%E A080747 Edited by C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 19 2004
%E A080747 More terms from _Giovanni Resta_, Aug 20 2018