login
Number of free pure achiral multifunctions (with empty expressions allowed) with one atom and n positions.
6

%I #12 Sep 11 2018 21:17:45

%S 1,1,2,5,12,31,79,211,564,1543,4259,11899,33526,95272,272544,784598,

%T 2270888,6604900,19293793,56581857,166523462,491674696,1455996925,

%U 4323328548,12869353254,38396655023,114803257039,343932660450,1032266513328,3103532577722

%N Number of free pure achiral multifunctions (with empty expressions allowed) with one atom and n positions.

%C A free pure achiral multifunction (with empty expressions allowed) (AME) is either (case 1) the leaf symbol "o", or (case 2) a possibly empty expression of the form h[g, ..., g] where h and g are AMEs. The number of positions in an AME is the number of brackets [...] plus the number of o's.

%C Also the number of achiral Mathematica expressions with one atom and n positions.

%H Andrew Howroyd, <a href="/A317882/b317882.txt">Table of n, a(n) for n = 1..200</a>

%F a(1) = 1; a(n > 1) = a(n - 1) + Sum_{0 < k < n - 1} a(k) * Sum_{d|(n - k - 1)} a(d).

%e The a(5) = 12 AMEs:

%e o[o[o]]

%e o[o][o]

%e o[o[][]]

%e o[o,o,o]

%e o[][o[]]

%e o[][o,o]

%e o[][][o]

%e o[o[]][]

%e o[o,o][]

%e o[][o][]

%e o[o][][]

%e o[][][][]

%t a[n_]:=If[n==1,1,Sum[a[k]*If[k==n-1,1,Sum[a[d],{d,Divisors[n-k-1]}]],{k,n-1}]];

%t Array[a,12]

%o (PARI) seq(n)={my(p=O(x)); for(n=1, n, p = x + p*x*(1 + sum(k=1, n-2, subst(p + O(x^(n\k+1)), x, x^k)) ) + O(x*x^n)); Vec(p)} \\ _Andrew Howroyd_, Aug 19 2018

%o (PARI) seq(n)={my(v=vector(n)); v[1]=1; for(n=2, #v, v[n]=v[n-1] + sum(i=1, n-2, v[i]*sumdiv(n-i-1, d, v[d]))); v} \\ _Andrew Howroyd_, Aug 19 2018

%Y Cf. A001003, A002033, A003238, A052893, A053492, A214577, A277996, A317853, A317875.

%Y Cf. A317883, A317884, A317885.

%K nonn

%O 1,3

%A _Gus Wiseman_, Aug 09 2018

%E Terms a(13) and beyond from _Andrew Howroyd_, Aug 19 2018