We present a natural, combinatorial problem whose solution is given by the metaFibonacci recurrence relation a(n) = Pp i=1 a(ni+1a(ni)), where p is prime. This combinatorial problem is less general than those given by Jackson and Ruskey, and Ruskey and Deugau, but it has the advantage of having a simpler statement.
展开▼
机译：我们呈现了一种自然的组合问题，其解决方案由MetafibonAcci复发关系A（n）= pp i = 1a（ni + 1a（ni）），其中p是素数。这种组合问题较少，而不是由杰克逊和Ruskey给出的那些，以及Ruskey和Deuuau，但它具有更简单的陈述的优势。
展开▼
