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.
%I A174563 #35 Aug 09 2020 01:17:09
%S A174563 1,14,133,3300,93889,3391086,148674191,7796637196,480640583751,
%T A174563 34370030511334,2818294139246649,262403744798653716,
%U A174563 27506121212584723373,3222018028986227724702,418998630100386520363619,60138044879434564251209580,9477043948863636836099726259,1632099068624734991723488992214
%N A174563 Number of 3 X n Latin rectangles such that every element of the second row has the same cyclic order (see comment).
%C A174563 We say that an element alpha_i of a permutation alpha of {1,2,...,n} has cyclic order k if it belongs to a cycle of length k of alpha. If every cycle of alpha has length k, then k|n.
%D A174563 V. S. Shevelev, Reduced Latin rectangles and square matrices with equal row and column sums, Diskr. Mat. [Journal published by the Academy of Sciences of Russia], 4 (1992), 91-110.
%D A174563 V. S. Shevelev, Modern enumeration theory of permutations with restricted positions, Diskr. Mat., 1993, 5, no.1, 3-35 (Russian) [English translation in Discrete Math. and Appl., 1993, 3:3, 229-263 (pp. 255-257)].
%F A174563 Let G_n = A000296(n) = n! * Sum_{2*k_2+...+n*k_n=n, k_i>=0} Product_{i=2,...,n} (k_i!*i!^k_i)^(-1). Then a(n) = Sum_{k=0,...,floor(n/2)} binomial(n,k) * G_k * G_(n-k) * u_(n-2*k), where u(n) = A000179(n). - _Vladimir Shevelev_, Mar 30 2016
%Y A174563 Cf. A000179, A000186, A000296, A094047, A174556, A174560, A174561.
%K A174563 nonn
%O A174563 3,2
%A A174563 _Vladimir Shevelev_, Mar 22 2010
%E A174563 More terms from _William P. Orrick_, Jul 25 2020