cp's OEIS Frontend

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.

A381377 E.g.f. A(x) satisfies A(x) = 1/( 1 - x * cosh(x * A(x)) )^2.

This page as a plain text file.
%I A381377 #10 Feb 22 2025 09:56:23
%S A381377 1,2,6,30,288,4090,68160,1292774,28627200,739821618,21729070080,
%T A381377 708442911022,25365382259712,992297344710698,42173572623716352,
%U A381377 1934344590577340790,95175474351245230080,5000227637170108004194,279428527333796676894720,16552583621200571079876158
%N A381377 E.g.f. A(x) satisfies A(x) = 1/( 1 - x * cosh(x * A(x)) )^2.
%C A381377 As stated in the comment of A185951, A185951(n,0) = 0^n.
%F A381377 E.g.f.: B(x)^2, where B(x) is the e.g.f. of A381376.
%F A381377 a(n) = 2 * Sum_{k=0..n} k! * binomial(2*n-k+2,k)/(2*n-k+2) * A185951(n,k).
%o A381377 (PARI) a185951(n, k) = binomial(n, k)/2^k*sum(j=0, k, (2*j-k)^(n-k)*binomial(k, j));
%o A381377 a(n) = 2*sum(k=0, n, k!*binomial(2*n-k+2, k)/(2*n-k+2)*a185951(n, k));
%Y A381377 Cf. A185951, A381206, A381376.
%K A381377 nonn
%O A381377 0,2
%A A381377 _Seiichi Manyama_, Feb 22 2025