%I A141770
%S A141770 1,2,12,680,3209712,94504354122272,100812007252263643279948656576,
%T A141770 135585824090362207213177704090990942335416773530694383100032,
%U A141770 2825708672665788300584159208646139967997334456450333766716987345856564900697077205449801648599000489425410959\
               47330649856
%N A141770 Number of recursively combed cube orientations.
%C A141770 An orientation of the edges of the d-dimensional hypercube is recursively 
               combed if there is at least one dimension along which all the edges 
               go into the same direction and the two (d-1)-dimensional cube orientations 
               resulting from the removal of all edges along that dimension are 
               again recursively combed.
%D A141770 GWOP 2008, 6th Gremo Workshop on Open Problems
%F A141770 f(n) = sum((-1)^(j+1)*2^j*binomial(n,j)*f(n-j)^(2^j), j=1..n), f(0) = 
               1
%p A141770 f[0] := 1; for k from 1 to 8 do f[k] := sum((-1)^(j+1)*2^j*binomial(k,
               j)*f[k-j]^(2^j), j=1..k); od;
%Y A141770 Sequence in context: A002860 A108078 A052129 this_sequence A060055 A061149 
               A129933
%Y A141770 Adjacent sequences: A141767 A141768 A141769 this_sequence A141771 A141772 
               A141773
%K A141770 nonn
%O A141770 0,2
%A A141770 Philipp Zumstein (zuphilip(AT)inf.ethz.ch), Sep 16 2008