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!)
A275098 Number of set partitions of [9*n] such that within each block the numbers of elements from all residue classes modulo 9 are equal. 2

%I #7 Jul 17 2020 10:24:52

%S 1,1,257,1699300,112660505345,44687884101953126,

%T 76502602935955053437072,451167428778794282789329512425,

%U 7771744024861563765933540267436016385,344735749788852590196707169431958672823413322,35650419033178479865362827431736721104304210986866382

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

%H Alois P. Heinz, <a href="/A275098/b275098.txt">Table of n, a(n) for n = 0..82</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!)^9 = exp(Sum_{n>=1} x^n / (n!)^9). - _Ilya Gutkovskiy_, Jul 17 2020

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

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

%p end:

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

%Y Column k=9 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 18 21:51 EDT 2024. Contains 371781 sequences. (Running on oeis4.)