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 A366369 #10 Oct 09 2023 09:25:31 %S A366369 1,1,2,6,6,30,10,70,70,210,42,462,462,6006,858,858,858,14586,4862, %T A366369 92378,92378,92378,8398,193154,193154,965770,74290,222870,222870, %U A366369 6463230,6463230,200360130,200360130,200360130,11785890,11785890,11785890,436077930,22951470,22951470,22951470,941010270,941010270 %N A366369 a(n) = product of primes p such that p^k <= n < 2*p^k for some k >= 1. %F A366369 a(n) = A003418(n) / A139550(n) = A003418(n) / A003418(floor(n/2)). %F A366369 a(n) = A003418(n)^2 / A366368(n). %o A366369 (PARI) a366369(n) = my(r=1); forprime(p=2, n, if(n<2*p^logint(n,p), r*=p)); r; %Y A366369 Subsequence of A005117. %Y A366369 Cf. A003418, A139550, A366368. %K A366369 nonn %O A366369 0,3 %A A366369 _Max Alekseyev_, Oct 08 2023