Total number of incoming edges at depth n in the solid partitions graph.

Terms

a(0) =1a(1) =4a(2) =16a(3) =46a(4) =128a(5) =332a(6) =842a(7) =2042a(8) =4846a(9) =11146a(10) =25114a(11) =55310a(12) =119662a(13) =254354a(14) =532784a(15) =1100411a(16) =2245118a(17) =4528212a(18) =9038898a(19) =17868025a(20) =35006932a(21) =68008606a(22) =131083778a(23) =250774482a(24) =476372848a(25) =898837825a(26) =1685107392a(27) =3139812791a(28) =5816015908a(29) =10712596279