A195646 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A195646

Number of ways of folding a 3 X 3 X ... X 3 n-dimensional map.

2

1, 6, 1368, 85109616

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

Table of n, a(n) for n=0..3.

W. F. Lunnon, A map-folding problem, Math. Comp. 22 (1968), 193-199.

W. F. Lunnon, Multi-dimensional map-folding, The Computer Journal, Volume 14, Issue 1, 1971, Pages 75-80.

Index entries for sequences obtained by enumerating foldings

CROSSREFS

Cf. A000136, A000560, A001417, A001418.

Sequence in context: A066037 A279924 A307871 * A265473 A199645 A300025

Adjacent sequences: A195643 A195644 A195645 * A195647 A195648 A195649

KEYWORD

nonn,hard,more

AUTHOR

N. J. A. Sloane, Sep 21 2011

STATUS

approved