cp's OEIS Frontend

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.

A193216 Least semiprime whose sum of prime factors equals n!

This page as a plain text file.
%I A193216 #5 Mar 30 2012 18:35:55
%S A193216 9,95,791,7799,85391,1248959,4717271,39916679,518918231,6227020631,
%T A193216 143221477871,1482030950111,61460695293791,1108907864061191,
%U A193216 20985558257660519,262497321934846319,12286155141292021799,75419962253475839039
%N A193216 Least semiprime whose sum of prime factors equals n!
%C A193216 Write n! = p+q (p,q prime), p*q minimal; then a(n)=p*q. Subset of A073046.
%e A193216 a(4) = 95 because,for n=4, 4! = 24; 24 = 5 + 19 = 7 + 17 = 11 + 13; 5*19 is minimal => p*q = 5*19 = 95.
%p A193216  with(numtheory):for n from 3 to 20 do:x:=n!:id:=0:for m from 2 to 10000 while(id=0) do:p:=ithprime(m):y:=x-p:if type(y,prime)=true then z:=y*p: id:=1:printf(`%d, `, z): else fi:od:od:
%Y A193216 Cf. A073046.
%K A193216 nonn
%O A193216 3,1
%A A193216 _Michel Lagneau_, Jul 18 2011