Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089177
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089177 Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= 1+log_2(floor(n)) giving number of non-squashing partitions of n into k parts. +0
3
1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 4, 4, 1, 1, 5, 6, 2, 1, 6, 9, 4, 1, 7, 12, 6, 1, 8, 16, 10, 1, 1, 9, 20, 14, 2, 1, 10, 25, 20, 4, 1, 11, 30, 26, 6, 1, 12, 36, 35, 10, 1, 13, 42, 44, 14, 1, 14, 49, 56, 20, 1, 15, 56, 68, 26, 1, 16, 64, 84, 36, 1, 1, 17, 72, 100, 46, 2, 1, 18, 81, 120, 60, 4, 1 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research