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.

A365283 E.g.f. satisfies A(x) = 1 + x*A(x)*exp(x^2*A(x)^2).

This page as a plain text file.
%I A365283 #12 Nov 08 2023 05:06:44
%S A365283 1,1,2,12,120,1380,19440,341040,7029120,164762640,4355769600,
%T A365283 128527439040,4181332700160,148633442717760,5734427199621120,
%U A365283 238676208285715200,10659325532663808000,508452777299622355200,25800664274991135129600
%N A365283 E.g.f. satisfies A(x) = 1 + x*A(x)*exp(x^2*A(x)^2).
%F A365283 a(n) = (n!/(n+1)) * Sum_{k=0..floor(n/2)} (n-2*k)^k * binomial(n+1,n-2*k)/k!.
%F A365283 a(n) ~ 2^(n/2) * (1 + 3*LambertW(2^(1/3)/3))^(n + 3/2) * n^(n-1) / (sqrt(1 + LambertW(2^(1/3)/3)) * 3^(3*n/2 + 2) * exp(n) * LambertW(2^(1/3)/3)^(3*(n+1)/2)). - _Vaclav Kotesovec_, Nov 08 2023
%t A365283 Join[{1},Table[n!/(n+1) * Sum[(n-2*k)^k * Binomial[n+1,n-2*k]/k!, {k, 0, Floor[n/2]}], {n,1,20}]] (* _Vaclav Kotesovec_, Nov 08 2023 *)
%o A365283 (PARI) a(n) = n!*sum(k=0, n\2, (n-2*k)^k*binomial(n+1, n-2*k)/k!)/(n+1);
%Y A365283 Cf. A358064, A365282, A365284.
%Y A365283 Cf. A161633, A365287.
%K A365283 nonn
%O A365283 0,3
%A A365283 _Seiichi Manyama_, Aug 31 2023