Number of partitions of 2n whose Ferrers-Young diagram cannot be tiled with dominoes.
A304710
Number of partitions of 2n whose Ferrers-Young diagram cannot be tiled with dominoes.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =1a(4) =2a(5) =6a(6) =12a(7) =25a(8) =46a(9) =85a(10) =146a(11) =250a(12) =410a(13) =666a(14) =1053a(15) =1648a(16) =2527a(17) =3840a(18) =5747a(19) =8525a(20) =12496a(21) =18172a(22) =26165a(23) =37408a(24) =53038a(25) =74714a(26) =104502a(27) =145315a(28) =200808a(29) =276030
External references
- oeis: A304710