id:A117274 - OEIS Search Results

Search: id:A117274

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,k) is the number of partitions of n with no even part repeated and having k 1's (n>=0, 0<=k<=n).

+0
3

1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 3, 2, 1, 1, 1, 0, 1, 3, 3, 2, 1, 1, 1, 0, 1, 4, 3, 3, 2, 1, 1, 1, 0, 1, 6, 4, 3, 3, 2, 1, 1, 1, 0, 1, 7, 6, 4, 3, 3, 2, 1, 1, 1, 0, 1, 9, 7, 6, 4, 3, 3, 2, 1, 1, 1, 0, 1, 12, 9, 7, 6, 4, 3, 3, 2, 1, 1, 1, 0, 1, 14, 12, 9, 7, 6, 4, 3, 3, 2, 1, 1, 1, 0 (list; table; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research