Define function fff to be the number of different arrays aaa of positive integers, such that the sum of the elements in array aaa equals to nnn. For example, f=4f=4f=4, and the four different arrays are {1,1,1},{1,2},{2,1},{3}{1,1,1},{1,2},{2,1},{3}{1,1,1},{1,2},{2,1},{3}. You are given a positive integer kkk. Please find the answer of fff.
Define function f(n)f(n)f(n) to be the number of different arrays aaa of positive integers, such that the sum of the elements in array aaa equals to nnn. For example, f(3)=4f(3)=4f(3)=4, and the four different arrays are {1,1,1},{1,2},{2,1},{3}{1,1,1},{1,2},{2,1},{3}{1,1,1},{1,2},{2,1},{3}. You are given a positive integer kkk. Please find the answer of f(k)f(k)f(k).
（图片来源网络，侵删）
