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 A322857 #18 May 30 2025 03:50:28
%S A322857 1,2,3,6,5,6,7,10,12,10,11,18,13,14,15,18,17,24,19,30,21,22,23,30,30,
%T A322857 26,30,42,29,30,31,34,33,34,35,72,37,38,39,50,41,42,43,66,60,46,47,54,
%U A322857 56,60,51,78,53,60,55,70,57,58,59,90,61,62,84,78,65,66,67
%N A322857 a(1) = 1; a(n) = sum of exponential unitary divisors of n for n > 1.
%C A322857 The exponential unitary (or e-unitary) divisors of n = Product p(i)^a(i) are all the numbers of the form Product p(i)^b(i) where b(i) is a unitary divisor of a(i).
%H A322857 Ivan Neretin, <a href="/A322857/b322857.txt">Table of n, a(n) for n = 1..10000</a>
%H A322857 Nicuşor Minculete and László Tóth, <a href="https://doi.org/10.71352/ac.35.205">Exponential unitary divisors</a>, Annales Univ. Sci. Budapest., Sect. Comp., Vol. 35 (2011), pp. 205-216.
%F A322857 Multiplicative with a(p^e) = Sum_{d|e, gcd(d, e/d)==1} p^d.
%t A322857 f[p_, e_] := DivisorSum[e, p^# &, GCD[#, e/#]==1 &]; eusigma[n_] := Times @@ f @@@ FactorInteger[n]; Array[eusigma, 100]
%o A322857 (PARI) ff(p, e) = sumdiv(e, d, if (gcd(d, e/d)==1, p^d));
%o A322857 a(n) = my(f=factor(n)); for (k=1, #f~, f[k,1] = ff(f[k,1], f[k,2]); f[k,2] = 1); factorback(f); \\ _Michel Marcus_, Dec 29 2018
%Y A322857 Cf. A361255, A051377, A077610, A278908 (number of exponential unitary divisors).
%K A322857 nonn,mult
%O A322857 1,2
%A A322857 _Amiram Eldar_, Dec 29 2018