s u m s ( n , k ) = { 1 , se k = 1 ∨ k = n n − 1 , se k = 2 ∑ i = 1 n − ( k − 1 ) s u m s ( n − i , k − 1 ) , altrimenti {\displaystyle sums(n,k)={\begin{cases}1,&{\text{se }}k=1\lor k=n\\n-1,&{\text{se }}k=2\\\sum _{i=1}^{n-(k-1)}sums(n-i,k-1),&{\text{altrimenti}}\end{cases}}}
p ( n , k ) = { 1 , se k = 0 ∨ n = 2 k − 1 n , se k = 1 2 , se n = 2 k p ( n − 1 , k ) + p ( n − 2 , k − 1 ) , altrimenti {\displaystyle p(n,k)={\begin{cases}1,&{\text{se }}k=0\lor n=2k-1\\n,&{\text{se }}k=1\\2,&{\text{se }}n=2k\\p(n-1,k)+p(n-2,k-1),&{\text{altrimenti}}\end{cases}}}
c r ( n , t ) = ∑ i = 1 n s u m s ( n , i ) ⋅ ( ∑ j = 0 ⌈ i / 2 ⌉ t i − j ⋅ p ( i , j ) ) {\displaystyle cr(n,t)=\sum _{i=1}^{n}sums(n,i)\cdot {\bigg (}\sum _{j=0}^{\lceil i/2\rceil }t^{i-j}\cdot p(i,j){\bigg )}}
