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 A369762 #8 Feb 03 2024 10:16:35
%S A369762 1,3,4,5,6,12,8,17,10,18,12,20,14,24,24,17,18,30,20,30,32,36,24,68,26,
%T A369762 42,82,40,30,72,32,257,48,54,48,50,38,60,56,102,42,96,44,60,60,72,48,
%U A369762 68,50,78,72,70,54,246,72,136,80,90,60,120,62,96,80,257,84,144
%N A369762 The sum of unitary divisors of the smallest multiple of n whose prime factorization exponents are all powers of 2.
%H A369762 Amiram Eldar, <a href="/A369762/b369762.txt">Table of n, a(n) for n = 1..10000</a>
%F A369762 a(n) = A034448(A356194(n)).
%F A369762 Multiplicative with a(p^e) = p^(2^ceiling(log_2(e))) + 1.
%F A369762 a(n) >= A034448(n), with equality if and only if n is in A138302.
%t A369762 f[p_, e_] := p^(2^Ceiling[Log2[e]]) + 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A369762 (PARI) s(n) = {my(e=logint(n, 2)); if(n == 2^e, n, 2^(e+1))};
%o A369762 a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i,1]^s(f[i,2]) + 1);}
%Y A369762 Cf. A034448, A138302, A353897, A356194, A369760, A369761.
%K A369762 nonn,easy,mult
%O A369762 1,2
%A A369762 _Amiram Eldar_, Jan 31 2024