Minimal number of disjoint edge-paths into which the graph of the n-ary cube can be partitioned.

Terms

a(0) =1a(1) =1a(2) =4a(3) =1a(4) =16a(5) =1a(6) =64a(7) =1a(8) =256a(9) =1a(10) =1024a(11) =1a(12) =4096a(13) =1a(14) =16384a(15) =1a(16) =65536a(17) =1a(18) =262144a(19) =1a(20) =1048576a(21) =1a(22) =4194304a(23) =1a(24) =16777216a(25) =1a(26) =67108864a(27) =1a(28) =268435456a(29) =1