Number of partitions of 2^n-1 into two summands >= 0 having a common divisor > 1.

Terms

a(0) =0a(1) =1a(2) =1a(3) =4a(4) =1a(5) =14a(6) =1a(7) =64a(8) =40a(9) =212a(10) =56a(11) =1184a(12) =1a(13) =2900a(14) =2884a(15) =16384a(16) =1a(17) =61088a(18) =1a(19) =284288a(20) =159520a(21) =776800a(22) =89264a(23) =5070848a(24) =577216a(25) =11195732a(26) =10375168a(27) =67834880a(28) =1522240a(29) =269570912