A098679 -id:A098679 - cp's OEIS frontend

A007283 a(n) = 3*2^n.

3, 6, 12, 24, 48, 96, 192, 384, 768, 1536, 3072, 6144, 12288, 24576, 49152, 98304, 196608, 393216, 786432, 1572864, 3145728, 6291456, 12582912, 25165824, 50331648, 100663296, 201326592, 402653184, 805306368, 1610612736, 3221225472, 6442450944, 12884901888

Offset: 0

N. J. A. Sloane

Same as Pisot sequences E(3, 6), L(3, 6), P(3, 6), T(3, 6). See A008776 for definitions of Pisot sequences.
Numbers k such that A006530(A000010(k)) = A000010(A006530(k)) = 2. - Labos Elemer, May 07 2002
Also least number m such that 2^n is the smallest proper divisor of m which is also a suffix of m in binary representation, see A080940. - Reinhard Zumkeller, Feb 25 2003
Length of the period of the sequence Fibonacci(k) (mod 2^(n+1)). - Benoit Cloitre, Mar 12 2003
The sequence of first differences is this sequence itself. - Alexandre Wajnberg and Eric Angelini, Sep 07 2005
Subsequence of A122132. - Reinhard Zumkeller, Aug 21 2006
Apart from the first term, a subsequence of A124509. - Reinhard Zumkeller, Nov 04 2006
Total number of Latin n-dimensional hypercubes (Latin polyhedra) of order 3. - Kenji Ohkuma (k-ookuma(AT)ipa.go.jp), Jan 10 2007
Number of different ternary hypercubes of dimension n. - Edwin Soedarmadji (edwin(AT)systems.caltech.edu), Dec 10 2005
For n >= 1, a(n) is equal to the number of functions f:{1, 2, ..., n + 1} -> {1, 2, 3} such that for fixed, different x_1, x_2,...,x_n in {1, 2, ..., n + 1} and fixed y_1, y_2,...,y_n in {1, 2, 3} we have f(x_i) <> y_i, (i = 1,2,...,n). - Milan Janjic, May 10 2007
a(n) written in base 2: 11, 110, 11000, 110000, ..., i.e.: 2 times 1, n times 0 (see A003953). - Jaroslav Krizek, Aug 17 2009
Subsequence of A051916. - Reinhard Zumkeller, Mar 20 2010
Numbers containing the number 3 in their Collatz trajectories. - Reinhard Zumkeller, Feb 20 2012
a(n-1) gives the number of ternary numbers with n digits with no two adjacent digits in common; e.g., for n=3 we have 010, 012, 020, 021, 101, 102, 120, 121, 201, 202, 210 and 212. - Jon Perry, Oct 10 2012
If n > 1, then a(n) is a solution for the equation sigma(x) + phi(x) = 3x-4. This equation also has solutions 84, 3348, 1450092, ...  which are not of the form 3*2^n. - Farideh Firoozbakht, Nov 30 2013
a(n) is the upper bound for the "X-ray number" of any convex body in E^(n + 2), conjectured by Bezdek and Zamfirescu, and proved in the plane E^2 (see the paper by Bezdek and Zamfirescu). - L. Edson Jeffery, Jan 11 2014
If T is a topology on a set V of size n and T is not the discrete topology, then T has at most 3 * 2^(n-2) many open sets. See Brown and Stephen references. - Ross La Haye, Jan 19 2014
Comment from Charles Fefferman, courtesy of Doron Zeilberger, Dec 02 2014: (Start)
Fix a dimension n. For a real-valued function f defined on a finite set E in R^n, let Norm(f, E) denote the inf of the C^2 norms of all functions F on R^n that agree with f on E. Then there exist constants k and C depending only on the dimension n such that Norm(f, E) <= C*max{ Norm(f, S) }, where the max is taken over all k-point subsets S in E.  Moreover, the best possible k is 3 * 2^(n-1).
The analogous result, with the same k, holds when the C^2 norm is replaced, e.g., by the C^1, alpha norm (0 < alpha <= 1). However, the optimal analogous k, e.g., for the C^3 norm is unknown.
For the above results, see Y. Brudnyi and P. Shvartsman (1994). (End)
Also, coordination sequence for (infinity, infinity, infinity) tiling of hyperbolic plane. - N. J. A. Sloane, Dec 29 2015
The average of consecutive powers of 2 beginning with 2^1. - Melvin Peralta and Miriam Ong Ante, May 14 2016
For n > 1, a(n) is the smallest Zumkeller number with n divisors that are also Zumkeller numbers (A083207). - Ivan N. Ianakiev, Dec 09 2016
Also, for n >= 2, the number of length-n strings over the alphabet {0,1,2,3} having only the single letters as nonempty palindromic subwords. (Corollary 21 in Fleischer and Shallit) - Jeffrey Shallit, Dec 02 2019
Also, a(n) is the minimum link-length of any covering trail, circuit, path, and cycle for the set of the 2^(n+2) vertices of an (n+2)-dimensional hypercube. - Marco Ripà, Aug 22 2022
The known fixed points of maps n -> A163511(n) and n -> A243071(n). [See comments in A163511]. - Antti Karttunen, Sep 06 2023
The finite subsequence a(3), a(4), a(5), a(6) = 24, 48, 96, 192 is one of only two geometric sequences that can be formed with all interior angles (all integer, in degrees) of a simple polygon. The other sequence is a subsequence of A000244 (see comment there). - Felix Huber, Feb 15 2024
A level 1 Sierpiński triangle is a triangle. Level n+1 is formed from three copies of level n by identifying pairs of corner vertices of each pair of triangles.  For n>2, a(n-3) is the radius of the level n Sierpiński triangle graph. - Allan Bickle, Aug 03 2024

Jason I. Brown, Discrete Structures and Their Interactions, CRC Press, 2013, p. 71.
T. Ito, Method, equipment, program and storage media for producing tables, Publication number JP2004-272104A, Japan Patent Office (written in Japanese, a(2)=12, a(3)=24, a(4)=48, a(5)=96, a(6)=192, a(7)=384 (a(7)=284 was corrected)).
Kenji Ohkuma, Atsuhiro Yamagishi and Toru Ito, Cryptography Research Group Technical report, IT Security Center, Information-Technology Promotion Agency, JAPAN.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
K. Bezdek and Tudor Zamfirescu, A Characterization of 3-dimensional Convex Sets with an Infinite X-ray Number, in: Coll. Math. Soc. J. Bolyai 63., Intuitive Geometry, Szeged (Hungary), North-Holland, Amsterdam, 1991, pp. 33-38.
Allan Bickle, Properties of Sierpinski Triangle Graphs, Springer PROMS 448 (2021) 295-303.
Yuri Brudnyi and Pavel Shvartsman, Generalizations of Whitney's extension theorem, International Mathematics Research Notices 1994.3 (1994): 129-139.
J. W. Cannon and P. Wagreich, Growth functions of surface groups, Mathematische Annalen, 1992, Volume 293, pp. 239-257. See Prop. 3.1.
Tomislav Došlić, Kepler-Bouwkamp Radius of Combinatorial Sequences, Journal of Integer Sequences, Vol. 17, 2014, #14.11.3.
John Elias, Illustration: 2^n+1 hexagram perimeters
Lukas Fleischer and Jeffrey Shallit, Words With Few Palindromes, Revisited, arxiv preprint arXiv:1911.12464 [cs.FL], November 27 2019.
A. Hinz, S. Klavzar, and S. Zemljic, A survey and classification of Sierpinski-type graphs, Discrete Applied Mathematics 217 3 (2017), 565-600.
Tanya Khovanova, Recursive Sequences
Roberto Rinaldi and Marco Ripà, Optimal cycles enclosing all the nodes of a k-dimensional hypercube, arXiv:2212.11216 [math.CO], 2022.
Edwin Soedarmadji, Latin Hypercubes and MDS Codes, Discrete Mathematics, Volume 306, Issue 12, Jun 28 2006, Pages 1232-1239
D. Stephen, Topology on Finite Sets, American Mathematical Monthly, 75: 739 - 741, 1968.
Index entries for linear recurrences with constant coefficients, signature (2).

Coordination sequences for triangular tilings of hyperbolic space: A001630, A007283, A054886, A078042, A096231, A163876, A179070, A265057, A265058, A265059, A265060, A265061, A265062, A265063, A265064, A265065, A265066, A265067, A265068, A265069, A265070, A265071, A265072, A265073, A265074, A265075, A265076, A265077.
Subsequence of the following sequences: A029744, A029747, A029748, A029750, A362804 (after 3), A364494, A364496, A364289, A364291, A364292, A364295, A364497, A364964, A365422.
Essentially same as A003945 and A042950.
Row sums of (5, 1)-Pascal triangle A093562 and of (1, 5) Pascal triangle A096940.
Cf. A000079, A100540, A124508, A221718.
Cf. Latin squares: A000315, A002860, A003090, A040082, A003191; Latin cubes: A098843, A098846, A098679, A099321.
Cf. A133466, A225546, A163511, A243071.
Cf. A007283, A029858, A067771, A193277, A233774, A233775, A246959.

a007283 = (* 3) . (2 ^)
a007283_list = iterate (* 2) 3
-- Reinhard Zumkeller, Mar 18 2012, Feb 20 2012

[3*2^n: n in [0..30]]; // Vincenzo Librandi, May 18 2011

A007283:=n->3*2^n; seq(A007283(n), n=0..50); # Wesley Ivan Hurt, Dec 03 2013

Table[3(2^n), {n, 0, 32}] (* Alonso del Arte, Mar 24 2011 *)

A007283(n):=3*2^n$
makelist(A007283(n),n,0,30); /* Martin Ettl, Nov 11 2012 */

PARI
```
a(n)=3*2^n
```

a(n)=3<Charles R Greathouse IV, Oct 10 2012

def A007283(n): return 3<Chai Wah Wu, Feb 14 2023

(List.fill(40)(2: BigInt)).scanLeft(1: BigInt)( * ).map(3 * ) // _Alonso del Arte, Nov 28 2019

G.f.: 3/(1-2*x).
a(n) = 2*a(n - 1), n > 0; a(0) = 3.
a(n) = Sum_{k = 0..n} (-1)^(k reduced (mod 3))*binomial(n, k). - Benoit Cloitre, Aug 20 2002
a(n) = A118416(n + 1, 2) for n > 1. - Reinhard Zumkeller, Apr 27 2006
a(n) = A000079(n) + A000079(n + 1). - Zerinvary Lajos, May 12 2007
a(n) = A000079(n)*3. - Omar E. Pol, Dec 16 2008
From Paul Curtz, Feb 05 2009: (Start)
a(n) = b(n) + b(n+3) for b = A001045, A078008, A154879.
a(n) = abs(b(n) - b(n+3)) with b(n) = (-1)^n*A084247(n). (End)
a(n) = 2^n + 2^(n + 1). - Jaroslav Krizek, Aug 17 2009
a(n) = A173786(n + 1, n) = A173787(n + 2, n). - Reinhard Zumkeller, Feb 28 2010
A216022(a(n)) = 6 and A216059(a(n)) = 7, for n > 0. - Reinhard Zumkeller, Sep 01 2012
a(n) = (A000225(n) + 1)*3. - Martin Ettl, Nov 11 2012
E.g.f.: 3*exp(2*x). - Ilya Gutkovskiy, May 15 2016
A020651(a(n)) = 2. - Yosu Yurramendi, Jun 01 2016
a(n) = sqrt(A014551(n + 1)*A014551(n + 2) + A014551(n)^2). - Ezhilarasu Velayutham, Sep 01 2019
a(A048672(n)) = A225546(A133466(n)). - Michel Marcus and Peter Munn, Nov 29 2019
Sum_{n>=1} 1/a(n) = 2/3. - Amiram Eldar, Oct 28 2020

A002860 Number of Latin squares of order n; or labeled quasigroups.

Original entry on oeis.org

1, 2, 12, 576, 161280, 812851200, 61479419904000, 108776032459082956800, 5524751496156892842531225600, 9982437658213039871725064756920320000, 776966836171770144107444346734230682311065600000

Offset: 1

N. J. A. Sloane

Also the number of minimum vertex colorings in the n X n rook graph. - Eric W. Weisstein, Mar 02 2024

David Nacin, "Puzzles, Parity Maps, and Plenty of Solutions", Chapter 15, The Mathematics of Various Entertaining Subjects: Volume 3 (2019), Jennifer Beineke & Jason Rosenhouse, eds. Princeton University Press, Princeton and Oxford, p. 245.
Clifford A. Pickover, The Math Book, From Pythagoras to the 57th Dimension, 250 Milestones in the History of Mathematics, Sterling Publ., NY, 2009.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 210.
H. J. Ryser, Combinatorial Mathematics. Mathematical Association of America, Carus Mathematical Monograph 14, 1963, p. 53.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Ronald Alter, Research Problems: How Many Latin Squares are There?, Amer. Math. Monthly 82 (1975), no. 6, 632-634. MR1537769.
Stanley E. Bammel and Jerome Rothstein, The number of 9 X 9 Latin squares, Discrete Math., 11 (1975), 93-95.
Daniel Berend, On the number of Sudoku squares, Discrete Mathematics 341.11 (2018): 3241-3248. See p. 3241.
Jeranfer Bermúdez, Richard García, Reynaldo López and Lourdes Morales, Some Properties of Latin Squares, Laboratorio Emmy Noether, 2009.
Matvey Borodin, Eric Chen, Aidan Duncan, Tanya Khovanova, Boyan Litchev, Jiahe Liu, Veronika Moroz, Matthew Qian, Rohith Raghavan, Garima Rastogi, and Michael Voigt, Sequences of the Stable Matching Problem, arXiv:2201.00645 [math.HO], 2021.
John W. Brown, Enumeration of Latin squares with application to order 8, J. Combin. Theory, 5 (1968), 177-184.
Nikhil Byrapuram, Hwiseo (Irene) Choi, Adam Ge, Selena Ge, Tanya Khovanova, Sylvia Zia Lee, Evin Liang, Rajarshi Mandal, Aika Oki, Daniel Wu, and Michael Yang, Quad Squares, arXiv:2308.07455 [math.HO], 2023.
Gloria S. Choi, Beyond Sudoku: New puzzle variants based on a novel mathematical mapping, J. High Sch. Sci. (2025) Vol. 9, No. 2, 70-84.
Hai-Dang Dau and Nicolas Chopin, Waste-free Sequential Monte Carlo, arXiv:2011.02328 [stat.CO], 2020.
Abdelrahman Desoky, Hany Ammar, Gamal Fahmy, Shaker El-Sappagh, Abdeltawab Hendawi, and Sameh H. Basha, Latin Square and Artificial Intelligence Cryptography for Blockchain and Centralized Systems, Int'l Conf. Adv. Intel. Sys. Informat., Proc. 9th Int'l Conf. (AISI 2023) pp. 444-455.
Thangavelu Geetha, Amritanshu Prasad, and Shraddha Srivastava, Schur Algebras for the Alternating Group and Koszul Duality, arXiv:1902.02465 [math.RT], 2019.
E. N. Gilbert, Latin squares which contain no repeated digrams, SIAM Rev. 7 1965 189-198. MR0179095 (31 #3346). Mentions this sequence. - _N. J. A. Sloane_, Mar 15 2014
Yue Guan, Minjia Shi and Denis S. Krotov, The Steiner triple systems of order 21 with a transversal subdesign TD(3,6), arXiv:1905.09081 [math.CO], 2019.
Michael Han, Tanya Khovanova, Ella Kim, Evin Liang, Miriam Lubashev, Oleg Polin, Vaibhav Rastogi, Benjamin Taycher, Ada Tsui and Cindy Wei, Fun with Latin Squares, arXiv:2109.01530 [math.HO], 2021.
Yang-Hui He and Minhyong Kim, Learning Algebraic Structures: Preliminary Investigations, arXiv:1905.02263 [cs.LG], 2019.
A.-A. A. Jucys, The number of distinct Latin squares as a group-theoretical constant, J. Combinatorial Theory Ser. A 20 (1976), no. 3, 265-272. MR0419259 (54 #7283).
Dieter Jungnickel and Vladimir D. Tonchev, Counting Steiner triple systems with classical parameters and prescribed rank, arXiv:1709.06044 [math.CO], 2017.
Lintao Liu, Xuehu Yan, Yuliang Lu, and Huaixi Wang, 2-threshold Ideal Secret Sharing Schemes Can Be Uniquely Modeled by Latin Squares, National University of Defense Technology, Hefei, China, (2019).
Brendan D. McKay, Alison Meynert and Wendy Myrvold, Small Latin Squares, Quasigroups and Loops, J. Combin. Des. 15 (2007), no. 2, 98-119.
Brendan D. McKay and Eric Rogoyski, Latin squares of order ten, Electron. J. Combinatorics, 2 (1995) #N3.
Brendan D. McKay and Ian M. Wanless, On the number of Latin squares. Preprint 2004.
Brendan D. McKay and Ian M. Wanless, On the number of Latin squares, Ann. Combinat. 9 (2005) 335-344.
Jia-yu Shao and Wan-di Wei, A formula for the number of Latin squares., Discrete Mathematics 110 (1992) 293-296.
Minjia Shi, Li Xu, and Denis S. Krotov, The number of the non-full-rank Steiner triple systems, arXiv:1806.00009 [math.CO], 2018.
Douglas S. Stones, The many formulas for the number of Latin rectangles, Electron. J. Combin 17 (2010), A1.
Douglas S. Stones and Ian M. Wanless, Divisors of the number of Latin rectangles, J. Combin. Theory Ser. A 117 (2010), 204-215.
Eric Weisstein's World of Mathematics, Latin Square.
Eric Weisstein's World of Mathematics, Minimum Vertex Coloring.
Eric Weisstein's World of Mathematics, Rook Graph.
Mark B. Wells, The number of Latin squares of order 8, J. Combin. Theory, 3 (1967), 98-99.
Krasimir Yordzhev, The bitwise operations in relation to obtaining Latin squares, arXiv preprint arXiv:1605.07171 [cs.OH], 2016.
Index entries for sequences related to Latin squares and rectangles
Index entries for sequences related to quasigroups

Cf. A000315, A000479.
Cf. A003090, A040082, A057991.
Cf. A098679 (Latin cubes).
A row of the array in A249026.

Table[Length[ResourceFunction["FindProperColorings"][GraphProduct[CompleteGraph[n], CompleteGraph[n], "Cartesian"], n]], {n, 5}]

a(n) = n!*A000479(n) = n!*(n-1)!*A000315(n).

One more term (from the McKay-Wanless article) from Richard Bean, Feb 17 2004

A249026 Array read by antidiagonals upwards: T(d,n) = number of d-dimensional permutations of n letters (d >= 0, n >= 1).

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 1, 2, 6, 4, 1, 2, 12, 24, 5, 1, 2, 24, 576, 120, 6, 1, 2, 48, 55296, 161280, 720, 7, 1, 2, 96, 36972288, 2781803520, 812851200, 5040, 8, 1, 2, 192, 6268637952000, 52260618977280, 994393803303936000, 61479419904000, 40320, 9

Offset: 0

N. J. A. Sloane, Oct 23 2014

By definition, this is the number of  nXnXnX...Xn = n^(d+1) arrays of 0's and 1's with exactly one 1 in each row, column, ..., line, ... .
An ordinary permutation is the case d = 1 (ordinary matrices with a single 1 in each row and column).
Rows d=2,3,... correspond to Latin squares, cubes, etc.

			The array begins:
d\n: 1, 2, 3,  4,  5,   6,   7,    8,     9,      10,      11,
--------------------------------------------------------------
0:   1, 2, 3,  4,  5,   6,   7,    8,     9,      10,      11,
1:   1, 2, 6,  24, 120, 720, 5040, 40320, 362880, 3628800, 39916800,  ...
2:   1, 2, 12, 576, 161280, 812851200, 61479419904000, 108776032459082956800,...
3:   1, 2, 24, 55296, 2781803520, 994393803303936000, ...
4:   1, 2, 48, 36972288, 52260618977280, ...
5:   1, 2, 96, 6268637952000, 2010196727432478720, ...
6:   1, 2, 192, ...
7:   1, 2, 384, ...
8:   1, 2, 768, ...
...

Linial, Nathan, and Zur Luria, An upper bound on the number of high-dimensional permutations, arXiv preprint arXiv:1106.0649 [math.CO], (2011).
Linial, Nathan, and Zur Luria, An upper bound on the number of high-dimensional permutations, Combinatorica, 34 (2014), 471-486.

Rows: A000142, A002860, A098679, A100540, A132206.
Column 4 = A249028.
See A249027 for another version.

A098843 Number of reduced Latin cubes of order n.

Original entry on oeis.org

1, 1, 1, 64, 40246, 95909896152

Offset: 1

N. J. A. Sloane, based on correspondence from Toru Ito (t_ito(AT)mue.biglobe.ne.jp), Nov 03 2004

There are at least two ways to define Latin cubes - see the Preece et al. paper. - Rosemary Bailey, Nov 03 2004

T. Ito, Method for producing Latin squares, Publication number JP2000-28510A, Japan Patent Office.
T. Ito, Method for producing Latin squares, JP3394467B, Patent abstracts of Japan,Japan Patent Office.
Jia, Xiong Wei and Qin, Zhong Ping, The number of Latin cubes and their isotopy classes, J. Huazhong Univ. Sci. Tech. 27 (1999), no. 11, 104-106. MathSciNet #MR1751724.

B. D. McKay and I. M. Wanless, A census of small latin hypercubes, SIAM J. Discrete Math. 22, (2008) 719-736.
Gary L. Mullen, and Robert E. Weber, Latin cubes of order <= 5, Discrete Math. 32 (1980), no. 3, 291-297. (Gives a(1)-a(5).)
D. A. Preece, S. C. Pearce and J. R. Kerr, Orthogonal designs for three-dimensional experiments, Biometrika 60 (1973), 349-358.

Cf. A098846 (isomorphism classes), A098679 (total number), A099321 (isotopy classes).

a(6) computed independently by Brendan McKay and Ian Wanless, Dec 17 2004

A099321 Number of isotopy classes of Latin cubes of order n.

Original entry on oeis.org

1, 1, 1, 12, 59, 5678334

Offset: 1

Brendan McKay and Weifa Liang (wliang(AT)users.cecs.anu.edu.au), Nov 18 2004

Jia, Xiong Wei and Qin, Zhong Ping, The number of Latin cubes and their isotopy classes, J. Huazhong Univ. Sci. Tech. 27 (1999), no. 11, 104-106. MathSciNet #MR1751724.
B. D. McKay and I. M. Wanless, A census of small latin hypercubes, SIAM J. Discrete Math. 22, (2008) 719-736.
Mullen, Gary L.; and Weber, Robert E., Latin cubes of order <= 5, Discrete Math. 32 (1980), no. 3, 291-297.

Cf. A098843, A098679, A098846.

Corrected and extended to a(6) by Brendan McKay and Ian Wanless, Apr 28 2008

A098846 Number of isomorphism classes of reduced Latin cubes of order n.

Original entry on oeis.org

1, 1, 1, 19, 1860, 799394226

Offset: 1

N. J. A. Sloane, Nov 03 2004

There are at least two ways to define Latin cubes - see the Preece et al. paper. - Rosemary Bailey, Nov 03 2004

B. D. McKay and I. M. Wanless, A census of small latin hypercubes, SIAM J. Discrete Math. 22, (2008) 719-736.
Gary L. Mullen, and Robert E. Weber, Latin cubes of order <= 5, Discrete Math. 32 (1980), no. 3, 291-297. (Gives a(1)-a(5).)
D. A. Preece, S. C. Pearce and J. R. Kerr, Orthogonal designs for three-dimensional experiments, Biometrika 60 (1973), 349-358.

Cf. A098843, A098679, A099321.

a(6) from the McKay-Wanless paper, sent by Ian Wanless, Apr 28 2008

A211215 Total number of Latin n-dimensional hypercubes of order 4; labeled n-ary quasigroups of order 4.

Original entry on oeis.org

4, 24, 576, 55296, 36972288, 6268637952000, 80686060158523011084288, 4465185218736554544676917926460256725000192, 4558271384916189349044295395852008182480786230841798008741684281906576963885826048

Offset: 0

Denis S. Krotov and Vladimir N. Potapov, Apr 06 2012

The values are calculated recursively, based on the characterization by 2009. The number a(5) was found before (2001 and, independently, later works) by exhaustive computer-aided classification of the objects.

T. Ito, Creation Method of Table, Creation Apparatus, Creation Program and Program Storage Medium, U.S. Patent application 20040243621, Dec 02 2004.

Denis S. Krotov and Vladimir N. Potapov, On the reconstruction of N-quasigroups of order 4 and the upper bounds on their numbers, Proc. Conference devoted to the 90th anniversary of Alexei A. Lyapunov (Novosibirsk, Russia, October 8-11, 2001), 2001.
Denis S. Krotov and Vladimir N. Potapov, n-Ary Quasigroups of Order 4, arXiv:math/0701519 [math.CO], 2007-2008; SIAM J. Discrete Math. 23:2 (2009), 561-570.
B. D. McKay and I. M. Wanless, A census of small latin hypercubes, SIAM J. Discrete Math. 22, (2008) 719-736.
Vladimir N. Potapov and Denis S. Krotov, On the number of n-ary quasigroups of finite order, arXiv:0912.5453 [math.CO], 2009-2016; Discrete Mathematics and Applications, 21:5-6 (2011), 575-586.

Cf. A002860, A098679, A100540, A132206.

Python
```
# See A211214.
```

a(n) = 4*6^n * A211214(n).

A249027 Array read by antidiagonals upwards: T(d,n) = number of d-dimensional permutations of n letters (d >= 1, n >= 1).

Original entry on oeis.org

1, 1, 2, 1, 2, 6, 1, 2, 12, 24, 1, 2, 24, 576, 120, 1, 2, 48, 55296, 161280, 720, 1, 2, 96, 36972288, 2781803520, 812851200, 5040, 1, 2, 192, 6268637952000, 52260618977280, 994393803303936000, 61479419904000, 40320

Offset: 1

N. J. A. Sloane, Oct 23 2014

By definition, this is the number of nXnXnX...Xn = n^(d+1) arrays of 0's and 1's with exactly one 1 in each row, column, ..., line, ... .
An ordinary permutation is the case d = 1 (ordinary matrices with a single 1 in each row and column).
Rows d=2,3,... correspond to Latin squares, cubes, etc.

			The array begins:
d\n: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
-----------------------------------------------------------
1: 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, ...
2: 1, 2, 12, 576, 161280, 812851200, 61479419904000, 108776032459082956800,...
3: 1, 2, 24, 55296, 2781803520, 994393803303936000, ...
4: 1, 2, 48, 36972288, 52260618977280, ...
5: 1, 2, 96, 6268637952000, 2010196727432478720, ...
6: 1, 2, 192, ...
7: 1, 2, 384, ...
8: 1, 2, 768, ...
...

Linial, Nathan, and Zur Luria, An upper bound on the number of high-dimensional permutations, arXiv preprint arXiv:1106.0649 [math.CO], (2011).
Linial, Nathan, and Zur Luria, An upper bound on the number of high-dimensional permutations, Combinatorica, 34 (2014), 471-486.

Rows: A000142, A002860, A098679, A100540, A132206.
Column 4 = A249028.
See A249026 for another version.

cp's OEIS Frontend

A007283 a(n) = 3*2^n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

PARI

Python

Scala

Formula

A002860 Number of Latin squares of order n; or labeled quasigroups.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A249026 Array read by antidiagonals upwards: T(d,n) = number of d-dimensional permutations of n letters (d >= 0, n >= 1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A098843 Number of reduced Latin cubes of order n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A099321 Number of isotopy classes of Latin cubes of order n.

Views

Author

Keywords

References

Crossrefs

Extensions

A098846 Number of isomorphism classes of reduced Latin cubes of order n.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A211215 Total number of Latin n-dimensional hypercubes of order 4; labeled n-ary quasigroups of order 4.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Python

Formula

A249027 Array read by antidiagonals upwards: T(d,n) = number of d-dimensional permutations of n letters (d >= 1, n >= 1).

Views

Author

Keywords

Comments