Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack.

A090641

Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =3a(8) =3a(9) =1a(10) =1a(11) =4a(12) =6a(13) =3a(14) =0a(15) =1a(16) =5a(17) =10a(18) =7a(19) =0a(20) =0a(21) =1a(22) =6a(23) =15a(24) =13a(25) =1a(26) =0a(27) =0a(28) =1a(29) =7

External references