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 A378630 #6 Dec 06 2024 11:09:59
%S A378630 1,2,4,6,12,24,30,48,60,120,210,240,420,840,1680,3360,6720,9240,13440,
%T A378630 18480,26880,36960,73920,147840,240240,295680,480480,591360,960960,
%U A378630 1921920,3843840,7687680,15375360,30750720,32672640,61501440,65345280,123002880,130690560
%N A378630 Numbers that set records in A376567.
%C A378630 Numbers n that set records for binomial(bigomega(n)+omega(n), omega(n)), where bigomega = A001222 and omega = A001221.
%C A378630 a(n) is of the form 2^k * P(i), k >= 0, where primorial P = A002110.
%C A378630 Proper subset of A070175.
%H A378630 Michael De Vlieger, <a href="/A378630/b378630.txt">Table of n, a(n) for n = 1..10000</a>
%t A378630 f[x_] := Block[{i, k, m, nn, p}, nn = Product[Prime[j], {j, x}]; Set[{k, i, p}, Range[0, 2]]; {1}~Join~Union@ Reap[Until[i > x, While[Set[m, 2^k*p] <= nn, Sow[m]; k++]; k = 0; i++; p *= Prime[i] ] ][[-1, 1]] ] (* generate A070175 *);
%t A378630 r = 0; Reap[Do[If[# > r, r = #; Sow[n]] &@ Binomial[#2 + #1, #1] & @@ {PrimeNu[n], PrimeOmega[n]}, {n, f[10]}] ][[-1, 1]]
%Y A378630 Cf. A000079, A001221, A001222, A002110, A007947, A070175, A376567.
%K A378630 nonn,easy
%O A378630 1,2
%A A378630 _Michael De Vlieger_, Dec 02 2024