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 A145119 #10 Nov 17 2019 01:49:18
%S A145119 1,2,4,16,32,96,384,1024,2048,10240,30720,73728,294912,688128,1835008,
%T A145119 12582912,25165824,56623104,283115520,629145600,1887436800,
%U A145119 11072962560,26575110144,57982058496,231928233984,753766760448,1758789107712
%N A145119 a(n) = Product_{k=1..n-1} (ceiling(n/k) - ceiling(n/k) mod 2).
%C A145119 Bounded by A010786 and A131385.
%C A145119 Each term has many more factors of two than any other prime factor.
%o A145119 (PARI) a(n) = prod(k=1, n-1, ceil(n/k) - ceil(n/k) % 2); \\ _Michel Marcus_, Nov 17 2019
%Y A145119 Cf. A010786, A131385, A131387.
%K A145119 easy,nonn
%O A145119 1,2
%A A145119 _Reikku Kulon_, Oct 02 2008