proposed
approved
proposed
approved
editing
proposed
For given m, the general formula for t_m(n, k) and the corresponding tables T, computed as in the example, determine a family of related sequences (placed in the rows or in the columns of T). For example, the sequences from the III, IV, 3rd, 4th, etc. rows of the given table are not represented in the OEIS till now. (End)
Denote the sum: m^n + m^n + ... + m^n, k times, by k.*m^n (m > 1, n > 0 and k are natural numbers). The general formula for the number of all partitions of the sum k.*m^n into powers of m is: t_m(n, k)= k+1 if n=1, t_m(n, k)= 1 if k=0, and t_m(n, k)= t_m(n, k-1) + t_m(n-1, k.*m) if n > 1 and k > 0. a(n) is obtained for m=3 and n=1,2,3,... - Valentin Bakoev, Feb 22 2009
a(n) = [x^(3^n)] 1/Product_{j>=0} (1-x^(3^j)). - Alois P. Heinz, Sep 27 2011
To obtain t_3(5,2) we use the table T, defined as T[i,j]= t_3(i,j), for i=1,2,...,5(=n), and j= 0,1,2,...,162(= k.m^{n-1}). It is: 1,2,3,4,5,6,7,8,...,162; 1,5,12,22,35,51,...,4510; (This this row contains the first 55 members of A000326 - the pentagonal numbers) 1,23,93,238,485,...,29773; 1,239,1632,5827,15200,32856,62629; 1,5828,68457; Column 1 contains the first 5 members of this sequence. - Valentin Bakoev, Feb 22 2009
proposed
editing
editing
proposed
From _Valentin Bakoev (v_bakoev(AT)yahoo.com), _, Feb 22 2009: (Start)
Denote the sum: m^n+m^n+...+m^n, k times, by k.m^n (m>1, n>0 and k are natural numbers). The general formula for the number of all partitions of the sum k.m^n into powers of m is: t_m(n, k)= k+1 if n=1, t_m(n, k)= 1 if k=0, and t_m(n, k)= t_m(n, k-1) + t_m(n-1, k.m) if n>1 and k>0. a(n) is obtained for m=3 and n=1,2,3,... - _Valentin Bakoev (v_bakoev(AT)yahoo.com), _, Feb 22 2009
To obtain t_3(5,2) we use the table T, defined as T[i,j]= t_3(i,j), for i=1,2,...,5(=n), and j= 0,1,2,...,162(= k.m^{n-1}). It is: 1,2,3,4,5,6,7,8,...,162; 1,5,12,22,35,51,...,4510; (This row contains the first 55 members of A000326 - the pentagonal numbers) 1,23,93,238,485,...,29773; 1,239,1632,5827,15200,32856,62629; 1,5828,68457; Column 1 contains the first 5 members of this sequence. - _Valentin Bakoev (v_bakoev(AT)yahoo.com), _, Feb 22 2009
approved
editing
editing
approved
For given m, the general formula for t_m(n, k) and the corresponding tables T, computed as in the example, determine a family of related sequences (placed in the rows or in the columns of T). For example, the sequences from the III, IV, etc. rows of the given table are not represented in the OEIS till now. (End)
approved
editing
proposed
approved
editing
proposed
Denote the sum: m^n+m^n+...+m^n, k times, by k.m^n (m>1, n>0 and k are natural numbers). The general formula for the number of all partitions of the sum k.m^n into powers of m is: t_m(n, k)= k+1 if n=1, t_m(n, k)= 1 if k=0, and t_m(n, k)= t_m(n, k-1) + t_m(n-1, k.m) if n>1 and k>0. A078125 a(n) is obtained for m=3 and n=1,2,3,... - Valentin Bakoev (v_bakoev(AT)yahoo.com), Feb 22 2009
To obtain t_3(5,2) we use the table T, defined as T[i,j]= t_3(i,j), for i=1,2,...,5(=n), and j= 0,1,2,...,162(= k.m^{n-1}). It is: 1,2,3,4,5,6,7,8,...,162; 1,5,12,22,35,51,...,4510; (This row contains the first 55 members of A000326 - the pentagonal numbers) 1,23,93,238,485,...,29773; 1,239,1632,5827,15200,32856,62629; 1,5828,68457; Column 1 contains the first 5 members of A078125this sequence. - Valentin Bakoev (v_bakoev(AT)yahoo.com), Feb 22 2009
proposed
editing