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 A009305 #31 Jan 27 2018 06:29:26
%S A009305 0,1,-1,5,-18,89,-600,4717,-42896,449073,-5287680,69090581,-993391872,
%T A009305 15583801609,-264816161792,4846181282685,-95022445824000,
%U A009305 1987373846425697,-44163232640630784,1039121484066627877,-25807915421845422080,674707915373741222841
%N A009305 Expansion of e.g.f. log(1 + x*cosh(x)).
%F A009305 a(n) = n!*Sum_{k=1..n-1} ((Sum_{i=0..k} (k-2*i)^(n-k)*binomial(k,i)) /(2^k*(n-k)!)*(-1)^(k-1)/k) + (-1)^(n-1)*(n-1)!. - _Vladimir Kruchinin_, Apr 21 2011
%F A009305 a(n) ~ (n-1)! * (-1)^(n+1) / r^n, where r = 0.765009954550732122655321742482815219200352137475... (see A069814) is the root of the equation r*cosh(r) = 1 . - _Vaclav Kotesovec_, Jan 24 2015
%t A009305 With[{nn=30},CoefficientList[Series[Log[1+Cosh[x]*x],{x,0,nn}],x]Range[ 0,nn]!] (* _Harvey P. Dale_, Mar 09 2013 *)
%o A009305 (Maxima)
%o A009305 a(n):=n!*sum(sum((k-2*i)^(n-k)*binomial(k,i),i,0,k)/(2^k*(n-k)!)*(-1)^(k-1)/k,k,1,n-1)+(-1)^(n-1)*(n-1)!; /* _Vladimir Kruchinin_, Apr 21 2011 */
%o A009305 (PARI) x='x+O('x^66); /* that many terms */
%o A009305 egf=log(1+x*cosh(x)); /* = x - 1/2*x^2 + 5/6*x^3 - 3/4*x^4 + 89/120*x^5 +-... */
%o A009305 Vec(serlaplace(egf)) /* show terms */ /* _Joerg Arndt_, Apr 21 2011 */
%Y A009305 Cf. A069814.
%K A009305 sign,easy
%O A009305 0,4
%A A009305 _R. H. Hardin_
%E A009305 Extended with signs by _Olivier Gérard_, Mar 15 1997
%E A009305 Definition corrected by _Joerg Arndt_, Apr 21 2011