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 A095194 #41 Jan 08 2025 09:27:06
%S A095194 0,1,2,7,2,1,1,1,1,1,2,1,1,7,17,1,1,1,31,13,1,59,13,7,1,61,41,37,31,1,
%T A095194 7,7,1,2,5,61,41,7,13,37,61,43,1,1,47,67,1,3,67,61,5,19,5,11,7,13,1,3,
%U A095194 1,71,11,1,67,109,103,43,29
%N A095194 Least number that yields a semiprime when appended to n!.
%C A095194 a(114) would require the factorization of the 190-digit number 1000*114!+181. - _Hugo Pfoertner_, May 18 2021
%H A095194 Tyler Busby, <a href="/A095194/b095194.txt">Table of n, a(n) for n = 1..126</a> (terms 1..101 from Sean A. Irvine, term 102 from Florian Baur, terms 103..113 from Hugo Pfoertner)
%e A095194 Refers to the semiprimes 10, 21, 62, 247, 1202, 7201, 50401, 403201, etc.
%p A095194 A095194 := proc(n) local nf,i,ns ; nf := convert(n!,base,10) ; for i from 1 do ns := [op(convert(i,base,10)),op(nf)] ; add( op(j,ns)*10^(j-1),j=1..nops(ns)) ; if numtheory[bigomega](%) = 2 then return i ; end if; end do: end proc: # _R. J. Mathar_, Jun 17 2011
%t A095194 Array[Block[{m = #!, k = 0}, While[PrimeOmega[10^If[k == 0, 1, IntegerLength[k]]*m + k] != 2, k++]; k] &, 40] (* _Michael De Vlieger_, May 17 2021 *)
%o A095194 (PARI) a(n)=for(i=0,1e9,bigomega(eval(Str(n!,i)))==2 & return(i)) \\ _M. F. Hasler_, Jun 17 2011
%Y A095194 Cf. A068845, A001358.
%K A095194 base,nonn,hard
%O A095194 1,3
%A A095194 _Jason Earls_, Jun 21 2004
%E A095194 Corrected and extended by _Sean A. Irvine_, Jun 16 2011