1 paper
Emily Downing, Elizabeth Hartung, Cody Lucido +1
Two k-ary Fibonacci recurrences are ak(n)=ak(n−1)+k⋅ak(n−2) and bk(n)=k⋅bk(n−1)+bk(n−2). We provide a simple proof that ak(n) is the number of $k…