|
%I #26 Nov 18 2023 07:08:38
%S 0,1,3,12,63,418,3460,35309,434879,6296319,104601742,1956519181,
%T 40622160668,926192254412,22993939511337,617288387438399,
%U 17815464892300869,550018928405927892,18086444341575141093,631071177229005331170,23286118567945953909224
%N Cumulated number of leaves in computations trees induced by process trees of size n.
%H Olivier Bodini, Antoine Genitrini and Frédéric Peschanski, <a href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.425">The Combinatorics of Non-determinism</a>, In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 425-436, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013).
%F See the paper by Bodini et al. in order to obtain the P-recurrence of order 9 satisfied by a(n).
%Y Cf. A007852.
%K nonn
%O 0,3
%A _Antoine Genitrini_, Mar 06 2014
|
