Given n boxes labeled 1..n, such that box i weighs 2i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed.
A090631
Given n boxes labeled 1..n, such that box i weighs 2i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =6a(4) =9a(5) =12a(6) =17a(7) =22a(8) =29a(9) =36a(10) =45a(11) =54a(12) =66a(13) =78a(14) =93a(15) =108a(16) =126a(17) =144a(18) =167a(19) =190a(20) =218a(21) =246a(22) =279a(23) =312a(24) =352a(25) =392a(26) =439a(27) =486a(28) =540a(29) =594
External references
- oeis: A090631