cp's OEIS Frontend

A258499 Number of words of length 4n such that all letters of the n-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word.

%I A258499 #11 Sep 27 2023 16:20:57
%S A258499 1,1,34,3509,657370,182587701,67773956250,31600247019120,
%T A258499 17769492060922914,11710509049983422030,8855064908059488718600,
%U A258499 7558849413204728468703991,7190781941414575290014093320,7544364858457252265315311530675,8654711454787575656983217747533920
%N A258499 Number of words of length 4n such that all letters of the n-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting doublets into the initially empty word.
%H A258499 Alois P. Heinz, <a href="/A258499/b258499.txt">Table of n, a(n) for n = 0..250</a>
%F A258499 a(n) = A256117(2n,n).
%F A258499 a(n) ~ c * d^n * n! / n^(5/2), where d = A256254 = 98.82487375173568573170688..., c = -sqrt(2) * LambertW(-2*exp(-2)) / (16 * Pi^(3/2) * sqrt(1 + LambertW(-2*exp(-2)))) = 0.008372249434869139279228556376854454452398... . - _Vaclav Kotesovec_, Jun 01 2015, updated Sep 27 2023
%p A258499 A:= proc(n, k) option remember; `if`(n=0, 1, k/n*
%p A258499       add(binomial(2*n, j)*(n-j)*(k-1)^j, j=0..n-1))
%p A258499     end:
%p A258499 T:= (n, k)-> add((-1)^i*A(n, k-i)/(i!*(k-i)!), i=0..k):
%p A258499 a:= n-> T(2*n, n):
%p A258499 seq(a(n), n=0..20);
%t A258499 A[n_, k_] := A[n, k] = If[n==0, 1, (k/n) Sum[Binomial[2n, j] (n-j) If[j==0, 1, (k-1)^j], {j, 0, n-1}]];
%t A258499 T[n_, k_] := Sum[(-1)^i A[n, k-i]/(i! (k-i)!), {i, 0, k}];
%t A258499 a[n_] := T[2n, n];
%t A258499 a /@ Range[0, 20] (* _Jean-François Alcover_, Dec 21 2020, after _Alois P. Heinz_ *)
%Y A258499 Cf. A256117.
%K A258499 nonn
%O A258499 0,3
%A A258499 _Alois P. Heinz_, May 31 2015