Let a partition of n be written in binary. Join any two binary ones which are adjacent horizontally or vertically. If all the binary ones are connected count this partition in a(n).

A318632

Let a partition of n be written in binary. Join any two binary ones which are adjacent horizontally or vertically. If all the binary ones are connected count this partition in a(n).

Terms

    a(0) =1a(1) =2a(2) =2a(3) =4a(4) =3a(5) =5a(6) =5a(7) =9a(8) =8a(9) =11a(10) =12a(11) =17a(12) =16a(13) =21a(14) =24a(15) =34a(16) =34a(17) =43a(18) =47a(19) =61a(20) =65a(21) =82a(22) =92a(23) =116a(24) =124a(25) =147a(26) =166a(27) =200a(28) =220a(29) =262

External references