cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A185141 a(n) = (n!)^(2*n).

This page as a plain text file.
%I A185141 #42 Oct 24 2023 12:39:52
%S A185141 1,1,16,46656,110075314176,619173642240000000000,
%T A185141 19408409961765342806016000000000000,
%U A185141 6823819180249038753817675898369448345600000000000000,48789725533845219197010193096946682961355723304326670581760000000000000000
%N A185141 a(n) = (n!)^(2*n).
%C A185141 a(n) is the number of "templates", or ways of placing a single digit within an n^2*n^2 Sudoku puzzle so that all rows, columns, and n*n blocks have exactly one copy of the digit.
%C A185141 a(n) is the number of preference profiles in a stable marriage problem with n men and n women. - _Tanya Khovanova_ and MIT PRIMES STEP Senior group, Mar 31 2021
%C A185141 a(n) is the product of the elements in the multiplication table [1..n] X [1..n]. - _Ivan N. Ianakiev_, Oct 04 2022
%H A185141 Michael De Vlieger, <a href="/A185141/b185141.txt">Table of n, a(n) for n = 0..22</a>
%H A185141 Matvey Borodin, Eric Chen, Aidan Duncan, Tanya Khovanova, Boyan Litchev, Jiahe Liu, Veronika Moroz, Matthew Qian, Rohith Raghavan, Garima Rastogi, and Michael Voigt, <a href="https://arxiv.org/abs/2108.02654">The Stable Matching Problem and Sudoku</a>, arXiv:2108.02654 [math.HO], 2021.
%H A185141 Matvey Borodin, Eric Chen, Aidan Duncan, Tanya Khovanova, Boyan Litchev, Jiahe Liu, Veronika Moroz, Matthew Qian, Rohith Raghavan, Garima Rastogi, and Michael Voigt, <a href="https://arxiv.org/abs/2201.00645">Sequences of the Stable Matching Problem</a>, arXiv:2201.00645 [math.HO], 2021.
%H A185141 Matvey Borodin, Eric Chen, Aidan Duncan, Tanya Khovanova, Boyan Litchev, Jiahe Liu, Veronika Moroz, Matthew Qian, Rohith Raghavan, Garima Rastogi, and Michael Voigt, <a href="https://doi.org/10.1080/07468342.2023.2261183">The Stable Marriage Problem and Sudoku</a>, College Math. J. (2023).
%H A185141 G. Dahl, <a href="https://doi.org/10.1016/j.laa.2008.12.023">Permutation matrices related to Sudoku</a>, Linear Algebra and its Applications, 430 (2001), 2457-2463.
%H A185141 sudopedia.org, <a href="http://sudopedia.org/wiki/Template">Template</a>
%F A185141 a(n) ~ n^(n*(2*n+1)) * 2^n * Pi^n / exp(2*n^2 - 1/6). - _Vaclav Kotesovec_, Feb 19 2015
%F A185141 Equals 2*n-th power of A000142.
%t A185141 Table[(n!)^(2 n), {n, 0, 7}] (* _T. D. Noe_, Jan 24 2012 *)
%o A185141 (PARI) for(n=0,5, print1((n!)^(2*n), ", ")) \\ _G. C. Greubel_, Jun 23 2017
%Y A185141 Cf. A000142.
%K A185141 nonn,easy
%O A185141 0,3
%A A185141 _David Eppstein_, Jan 23 2012