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 A172609 #26 Sep 08 2022 08:45:50
%S A172609 1,1,12870,9465511770,99561092450391000,7656714453153197981835000,
%T A172609 2889253496242619386328267523990000,
%U A172609 4104167472585675600759440022842715359250000,18165723931630806756964027928179555634194028454000000
%N A172609 a(n) = (8n)!/(8!^n).
%C A172609 From _Tilman Piesk_, Oct 30 2014: (Start)
%C A172609 Column 8 of A187783.
%C A172609 Number of permutations of a multiset that contains n different elements, each occurring 8 times.
%C A172609 Or in other words (the former title of this sequence):
%C A172609 Number of 8*n X n 0..1 arrays with row sums 1 and column sums 8.
%C A172609 (End)
%H A172609 Tilman Piesk, <a href="/A172609/b172609.txt">Table of n, a(n) for n = 0..54</a> (first 12 terms from R. H. Hardin)
%F A172609 a(n) = (8n)!/(8!^n).
%e A172609 a(3) = (8*3)!/(8!^3) = 9465511770 is the number of permutations of a multiset that contains 3 different elements 8 times, e.g., {1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3}.
%p A172609 A172609:=n->(8*n)!/(40320^n): seq(A172609(n), n=0..10); # _Wesley Ivan Hurt_, Nov 01 2014
%t A172609 Table[(8 n)! / (40320^n), {n, 0, 10}] (* _Vincenzo Librandi_, Nov 01 2014 *)
%o A172609 (Magma) [Factorial(8*n)/(40320^n): n in [0..20]]; // _Vincenzo Librandi_, Nov 01 2014
%K A172609 nonn,easy
%O A172609 0,3
%A A172609 _R. H. Hardin_, Feb 06 2010
%E A172609 Name changed by _Tilman Piesk_, Oct 30 2014