a(n) is the number of states that can be achieved when starting from n piles each containing one stone, where any number of stones can be transferred between piles that start with the same number of stones.
A292726
a(n) is the number of states that can be achieved when starting from n piles each containing one stone, where any number of stones can be transferred between piles that start with the same number of stones.
Terms
- a(0) =1a(1) =2a(2) =2a(3) =5a(4) =6a(5) =8a(6) =14a(7) =22a(8) =27a(9) =38a(10) =55a(11) =70a(12) =100a(13) =130a(14) =167a(15) =231a(16) =296a(17) =371a(18) =489a(19) =618a(20) =775a(21) =995a(22) =1254a(23) =1549a(24) =1951a(25) =2428a(26) =2980a(27) =3707a(28) =4564a(29) =5549
External references
- oeis: A292726