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 A138903 #16 Feb 10 2024 04:44:52
%S A138903 1,3,21,234,3590,70254,1672972,46955760,1517994792,55549351800,
%T A138903 2269918543640,102452561694864,5062050729973120,271751784988056576,
%U A138903 15750949414628405760,980315266648197537792,65207656047198387921536
%N A138903 a(n) = (1/2^n)* Sum_{k=0..n} binomial(n,k)*(n+k)^(n-1).
%F A138903 E.g.f.: A(x) = log(B(x)), where B(x) is e.g.f. of A138860.
%F A138903 E.g.f.: A(x) = Series_Reversion[ 2*x/(exp(x) + exp(2*x)) ].
%F A138903 a(n) ~ n^(n-1)*(1+r)^n*r^n/(sqrt(1+3*r)*(1-r)^(2*n)*exp(n)*2^n), where r = 0.6472709258412625... is the root of the equation (r/(1-r))^(1+r) = e. - _Vaclav Kotesovec_, Jun 15 2013
%p A138903 A138903 := proc(n) local k ; add(binomial(n,k)*(n+k)^(n-1),k=0..n)/2^n ; end: seq(A138903(n),n=1..20) ; # _R. J. Mathar_, Apr 12 2008
%t A138903 Table[1/2^n * Sum[Binomial[n,k]*(n+k)^(n-1),{k,0,n}],{n,1,20}] (* _Vaclav Kotesovec_, Jun 15 2013 *)
%o A138903 (PARI) {a(n)=local(X=x+x*O(x^n)); n!*polcoeff(serreverse(2*x/(exp(X)+exp(2*X)) ), n)}
%K A138903 easy,nonn
%O A138903 1,2
%A A138903 _Paul D. Hanna_ and _Vladeta Jovovic_, Apr 02 2008, Apr 03 2008
%E A138903 More terms from _R. J. Mathar_, Apr 12 2008