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 A378746 #7 Dec 08 2024 17:18:01
%S A378746 6,15,35,1001,46189,96577,6678671,14535931,1348781387,146078888479,
%T A378746 18128893780549,203079283326684719,433601713048867373,
%U A378746 877779077635511999,1816798556036292277,39006703653387621491281,969956148531489825059765363,16439934720872708899318057,4483790064773102589474664169,1274400211992152128527851190601
%N A378746 a(n) = Product{i=n..primepi(2*prime(n))} prime(i).
%C A378746 Each a(n) is a proper divisor of A007741(n).
%C A378746 Each a(n) or one of its proper divisors is present in A337372.
%C A378746 a(n) is the least product of consecutive primes starting from A000040(n) such that A003961(a(n)) > 2*a(n). Note that 6, 15, 35, 46189 and 96577 are all present in A337372, i.e., are primitively primeshift-abundant numbers. For 1001 = 7*11*31, it is however its proper divisor 91 = 7*31 which gets that honor.
%H A378746 Antti Karttunen, <a href="/A378746/b378746.txt">Table of n, a(n) for n = 1..344</a>
%o A378746 (PARI) A378746(n) = prod(i=n,primepi(2*prime(n)),prime(i));
%Y A378746 Cf. A003961, A007741, A063124 [= A001222(a(n))], A337372.
%Y A378746 Subsequence of A097889.
%Y A378746 Cf. also A378745.
%K A378746 nonn
%O A378746 1,1
%A A378746 _Antti Karttunen_, Dec 08 2024