Sums of Ceiling Functions Solve Nested Recursions     Nested recursion  Ceiling function  Formal satisfaction  Equivalence class       font style='font-size:12px;'> 2011/9/15

Abstract: It is known that, for given integers s \geq 0 and j > 0, the nested recursion R(n) = R(n - s - R(n - j)) + R(n - 2j - s - R(n - 3j)) has a closed form solution for which a combinatorial inte...

存档文本 存档附件 原文地址 文献传递