Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Dec 04 2024 20:38:14
%S 1,6,1368,85109616
%N Number of ways of folding a 3 X 3 X ... X 3 n-dimensional map.
%H W. F. Lunnon, <a href="http://dx.doi.org/10.1090/S0025-5718-1968-0221957-8">A map-folding problem</a>, Math. Comp. 22 (1968), 193-199.
%H W. F. Lunnon, <a href="https://doi.org/10.1093/comjnl/14.1.75">Multi-dimensional map-folding</a>, The Computer Journal, Volume 14, Issue 1, 1971, Pages 75-80.
%H <a href="/index/Fo#fold">Index entries for sequences obtained by enumerating foldings</a>
%Y Cf. A000136, A000560, A001417, A001418.
%K nonn,hard,more
%O 0,2
%A _N. J. A. Sloane_, Sep 21 2011