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 A363661 #18 Nov 23 2023 20:21:11
%S A363661 2,12,32,150,282,1890,3488,21582,54650,282612,705564,4072224,10400782,
%T A363661 55006530,158987232,790611350,2333606526,11573213196,35345264180,
%U A363661 168673694070,540848064614,2500462200182,8233430728152,37445946291600,126411051769652
%N A363661 a(n) = Sum_{d|n} (n/d)^d * binomial(d+n,n).
%C A363661 All terms are even. - _Robert Israel_, Nov 23 2023
%H A363661 Robert Israel, <a href="/A363661/b363661.txt">Table of n, a(n) for n = 1..1655</a>
%F A363661 a(n) = [x^n] Sum_{k>0} (1/(1 - k*x^k)^(n+1) - 1).
%p A363661 f:= proc(n) local d;
%p A363661 add((n/d)^d * binomial(n+d,n), d = numtheory:-divisors(n))
%p A363661 end proc:
%p A363661 map(f, [$1..30]); # _Robert Israel_, Nov 23 2023
%t A363661 a[n_] := DivisorSum[n, (n/#)^# * Binomial[# + n, n] &]; Array[a, 30] (* _Amiram Eldar_, Jul 05 2023 *)
%o A363661 (PARI) a(n) = sumdiv(n, d, (n/d)^d*binomial(d+n, n));
%Y A363661 Cf. A362683, A363639, A363640.
%Y A363661 Cf. A055225, A363660, A363662, A363663.
%K A363661 nonn
%O A363661 1,1
%A A363661 _Seiichi Manyama_, Jun 14 2023