# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a293809
Showing 1-1 of 1

%I A293809 #13 Nov 23 2023 10:37:52
%S A293809 1,2,7,22,73,240,818,2824,10004,36252,134594,512632,2002797,8037634,
%T A293809 33122211,140287074,610344666,2728599114,12524559427,59014996342,
%U A293809 285169596358,1412357461074,7161541766341,37150562120334,196945057245451,1066104659977212
%N A293809 Number of multisets of exactly n nonempty words with a total of 2n letters over 2n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
%H A293809 Alois P. Heinz, <a href="/A293809/b293809.txt">Table of n, a(n) for n = 0..800</a>
%F A293809 G.f.: Product_{j>=1} 1/(1-x^j)^A000085(j+1).
%F A293809 Euler transform of j-> A000085(j+1).
%F A293809 a(n) = A293808(2n,n).
%e A293809 a(0) = 1: {}.
%e A293809 a(1) = 2: {aa}, {ab}.
%e A293809 a(2) = 7: {a,aaa}, {a,aab}, {a,aba}, {a,abc}, {aa,aa}, {aa,ab}, {ab,ab}.
%p A293809 g:= proc(n) option remember; `if`(n<2, 1, g(n-1)+(n-1)*g(n-2)) end:
%p A293809 a:= proc(n) option remember; `if`(n=0, 1, add(add(d*
%p A293809       g(d+1), d=numtheory[divisors](j))*a(n-j), j=1..n)/n)
%p A293809     end:
%p A293809 seq(a(n), n=0..30);
%t A293809 g[n_] := g[n] = If[n < 2, 1, g[n-1] + (n-1)*g[n-2]];
%t A293809 a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d*g[d+1], {d, Divisors[j]}]*a[n-j], {j, 1, n}]/n];
%t A293809 Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Nov 23 2023, after _Alois P. Heinz_ *)
%Y A293809 Cf. A000085, A293808.
%K A293809 nonn
%O A293809 0,2
%A A293809 _Alois P. Heinz_, Oct 16 2017

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE