login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275099 Number of set partitions of [10*n] such that within each block the numbers of elements from all residue classes modulo 10 are equal. 2

%I #12 Jun 27 2022 07:54:40

%S 1,1,513,10136746,2672797504001,5260857687009765626,

%T 53531132944198868710856802,2185249026716732313958375321948613,

%U 297263694975439941710846391262298377605633,116941828532092016226313310933885429108622288425362

%N Number of set partitions of [10*n] such that within each block the numbers of elements from all residue classes modulo 10 are equal.

%H Alois P. Heinz, <a href="/A275099/b275099.txt">Table of n, a(n) for n = 0..75</a>

%H J.-M. Sixdeniers, K. A. Penson and A. I. Solomon, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL4/SIXDENIERS/bell.html">Extended Bell and Stirling Numbers From Hypergeometric Exponentiation</a>, J. Integer Seqs. Vol. 4 (2001), #01.1.4.

%F Sum_{n>=0} a(n) * x^n / (n!)^10 = exp(Sum_{n>=1} x^n / (n!)^10). - _Ilya Gutkovskiy_, Jul 17 2020

%p a:= proc(n) option remember; `if`(n=0, 1, add(

%p binomial(n, j)^10*(n-j)*a(j), j=0..n-1)/n)

%p end:

%p seq(a(n), n=0..12);

%t a[n_] := a[n] = If[n==0, 1, Sum[Binomial[n, j]^10*(n-j)*a[j], {j, 0, n-1}]/n];

%t Table[a[n], {n, 0, 12}] (* _Jean-François Alcover_, Jun 27 2022, after _Alois P. Heinz_ *)

%Y Column k=10 of A275043.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Jul 16 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)