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 A056653 #24 Aug 01 2024 01:39:10
%S A056653 1,6,8,9,10,12,14,15,16,18,20,21,22,24,25,26,27,28,30,32,33,34,35,36,
%T A056653 38,39,40,42,44,45,46,48,49,50,51,52,54,55,56,57,58,60,62,63,64,65,66,
%U A056653 68,69,70,72,74,75,76,77,78,80,81,82,84,85,86,87,88,90,91,92,93,94,95
%N A056653 Composite numbers together with 1 but excluding 4.
%C A056653 These are also the numbers k such that k divides (k-1)!.
%H A056653 Vincenzo Librandi, <a href="/A056653/b056653.txt">Table of n, a(n) for n = 1..1000</a>
%p A056653 for n from 1 to 100 do
%p A056653 if irem(factorial(n-1),n) = 0 then print(n) end if;
%p A056653 end do: # _Peter Bala_, Jan 24 2017
%t A056653 Select[ Range[ 1, 100 ], Mod[ (# - 1)!, # ] == 0 & ]
%t A056653 Join[{1},Select[Range[5,100],CompositeQ]] (* _Harvey P. Dale_, Jun 14 2024 *)
%o A056653 (Python)
%o A056653 from sympy import composite
%o A056653 def A056653(n): return composite(n) if n>1 else 1 # _Chai Wah Wu_, Jul 31 2024
%Y A056653 Cf. A018252, A002808, A226198, A014076 (odd terms).
%K A056653 nonn,easy
%O A056653 1,2
%A A056653 _Robert G. Wilson v_, Aug 30 2000
%E A056653 Edited by _Vladeta Jovovic_, Apr 30 2003