T(n,k) = Number of partitions of n+2k-2 into parts >= k.
1, 1, 2, 1, 2, 3, 1, 2, 2, 5, 1, 2, 2, 4, 7, 1, 2, 2, 3, 4, 11, 1, 2, 2, 3, 4, 7, 15, 1, 2, 2, 3, 3
5 seqfan posts
Sun Nov 6 23:51:36 CET 2011 [seqfan] Re: Counting permutations
Fri Nov 4 21:56:50 CET 2011 [seqfan] Re: Fw: Problem submitting a sequence - follow up
Fri Nov 4 15:31:03 CET 2011 [seqfan] Re: Problem submitting a sequence
Fri Nov 4 11:58:10 CET 2011 [seqfan] Fw: Problem submitting a sequence - follow up
Fri Nov 4 11:41:53 CET 2011 [seqfan] Problem submitting a sequence
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
.