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 A078541 #15 Jan 27 2025 02:23:55
%S A078541 1,2,8,12,36,80,96,128,288,448,2560,6144,11264,18432,32768,53248,
%T A078541 57344,245760,737280,1114112,2621440,4980736,22020096,23068672,
%U A078541 25165824,66060288,75497472,96468992,436207616,939524096,1258291200,1811939328,2147483648,3774873600
%N A078541 Refactorable numbers x, such that quotient x/A000005(x) equals a power of 2.
%C A078541 This sequence is infinite since it contains all the terms of A058891. Also, 3*2^A083329(k) is a term for all k >= 1. - _Amiram Eldar_, Jan 27 2025
%H A078541 Donovan Johnson, <a href="/A078541/b078541.txt">Table of n, a(n) for n = 1..100</a>
%F A078541 a(n)/tau(a(n))=2^s with some s, tau()=A000005().
%e A078541 a(6)=80: tau(80)=10, quotient=80/10=8=2^3; certain powers of 2 do not appear as quotient, like 64, 1024, 16384.
%t A078541 Do[s=n/DivisorSigma[0, n]; If[IntegerQ[Log[2, s]], Print[{n, s, n/s}]], {n, 1, 1000000000}]
%o A078541 (PARI) isok(k) = my(r = k/numdiv(k)); denominator(r) == 1 && r >> valuation(r, 2) == 1; \\ _Amiram Eldar_, Jan 27 2025
%Y A078541 Cf. A000005, A033950, A036763, A051278, A051279, A051280, A058891, A083329.
%K A078541 nonn
%O A078541 1,2
%A A078541 _Labos Elemer_, Dec 04 2002
%E A078541 a(29)-a(34) from _Donovan Johnson_, Jun 04 2011