**T(n,k)=Number of strings of numbers x(i=1..n) in 0..k with sum i^3*x(i) equal to n^3*k**

*1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 1, 1, 2, 3, 1, 3, 1, 1, 1, 3, 4, 5, 10*

*5 seqfan posts*

*Wed Jan 12 10:53:34 CET 2011* [seqfan] Re: Linear recurrences with large gaps

*Wed Jan 12 09:41:12 CET 2011* [seqfan] Re: Linear recurrences with large gaps

*Tue Jan 11 14:15:35 CET 2011* [seqfan] Re: Linear recurrences with large gaps

*Tue Jan 11 13:47:45 CET 2011* [seqfan] Re: Linear recurrences with large gaps

*Mon Jan 10 20:16:36 CET 2011* [seqfan] Linear recurrences with large gaps

Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword

Links to OEIS content are included according to
The OEIS End-User License Agreement
.