# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a025041
Showing 1-1 of 1

%I A025041 #37 Aug 08 2024 11:05:02
%S A025041 1,1,24310,37978905250,893864677761055000,158421985022100255941485000,
%T A025041 140413003088367308737750586624350000,
%U A025041 474750200441159213998774295008486246570750000
%N A025041 Number of partitions of { 1, 2, ..., 9n } into sets of size 9.
%H A025041 Andrew Howroyd, <a href="/A025041/b025041.txt">Table of n, a(n) for n = 0..50</a>
%H A025041 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 A025041 a(n) = (9*n)!/(n!*(9!)^n). - _Christian G. Bower_, Sep 15 1998
%t A025041 Table[Pochhammer[n + 1, 8*n]/9!^n, {n, 0, 10}] (* _Paolo Xausa_, Aug 08 2024 *)
%Y A025041 Column k=9 of A060540.
%K A025041 nonn,easy
%O A025041 0,3
%A A025041 _David W. Wilson_
%E A025041 a(0)=1 from _Andrew Howroyd_, Feb 26 2018

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE