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 A333823 #15 Jul 09 2023 12:13:42
%S A333823 1,2,4,4,6,14,8,8,37,42,12,76,14,142,384,16,18,746,20,1044,2552,2070,
%T A333823 24,536,3151,8218,20440,16412,30,41574,32,32,178512,131106,94968,
%U A333823 263908,38,524326,1596560,32808,42,2379874,44,4194348,16364502,8388654,48,4144,823593,33654482
%N A333823 a(n) = Sum_{d|n, d odd} (n/d)^d.
%H A333823 Seiichi Manyama, <a href="/A333823/b333823.txt">Table of n, a(n) for n = 1..5000</a>
%F A333823 G.f.: Sum_{k>=1} k * x^k / (1 - k^2*x^(2*k)).
%F A333823 a(2^n) = 2^n. - _Seiichi Manyama_, Apr 07 2020
%t A333823 Table[DivisorSum[n, (n/#)^# &, OddQ[#] &], {n, 50}]
%t A333823 nmax = 50; CoefficientList[Series[Sum[k x^k/(1 - k^2 x^(2 k)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
%o A333823 (PARI) a(n) = sumdiv(n, d, if ((d)%2, (n/d)^d)); \\ _Michel Marcus_, Apr 07 2020
%o A333823 (Python)
%o A333823 from sympy import divisors
%o A333823 def A333823(n): return sum((n//d)**d for d in divisors(n>>(~n & n-1).bit_length(),generator=True)) # _Chai Wah Wu_, Jul 09 2023
%Y A333823 Cf. A055225, A333824.
%K A333823 nonn
%O A333823 1,2
%A A333823 _Ilya Gutkovskiy_, Apr 06 2020