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 A025040 #33 Aug 28 2025 10:28:02
%S A025040 1,1,6435,1577585295,4148378852099625,63805953776276649848625,
%T A025040 4012852078114749147678149338875,
%U A025040 814318942973348333484015877548157809375,450538787986875167583433232345723106006796340625,599167346385710947364525167684682505182168120225201390625
%N A025040 Number of partitions of { 1, 2, ..., 8n } into sets of size 8.
%H A025040 Andrew Howroyd, <a href="/A025040/b025040.txt">Table of n, a(n) for n = 0..50</a>
%H A025040 Cyril Banderier, Philippe Marchal, and Michael Wallner, <a href="https://arxiv.org/abs/1805.09017">Rectangular Young tableaux with local decreases and the density method for uniform random generation</a> (short version), arXiv:1805.09017 [cs.DM], 2018.
%F A025040 a(n) = (8n)!/(n!(8!)^n). - _Christian G. Bower_, Sep 15 1998
%F A025040 a(n) ~ 2^(17*n+3/2) * (n/e)^(7*n) / 315^n. - _Amiram Eldar_, Aug 28 2025
%t A025040 Table[Pochhammer[n + 1, 7*n]/8!^n, {n, 0, 10}] (* _Paolo Xausa_, Aug 08 2024 *)
%Y A025040 Column k=8 of A060540.
%K A025040 nonn,changed
%O A025040 0,3
%A A025040 _David W. Wilson_
%E A025040 a(0)=1 from _Andrew Howroyd_, Feb 26 2018