The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A302919 The number of ways of placing 2n-1 white balls and 2n-1 black balls into unlabeled bins such that each bin has both an odd number of white balls and black balls. 0

%I #22 Aug 12 2022 09:18:30

%S 1,2,4,12,32,85,217,539,1316,3146,7374,16969,38387,85452,187456,

%T 405659,866759,1830086,3821072,7894447,16148593,32723147,65719405,

%U 130871128,258513076,506724988,985968770,1904992841,3655873294,6970687150,13208622956,24879427889,46593011280,86773920240,160742462714,296227087942,543183754454,991213989213

%N The number of ways of placing 2n-1 white balls and 2n-1 black balls into unlabeled bins such that each bin has both an odd number of white balls and black balls.

%H Marko Riedel, <a href="https://math.stackexchange.com/a/2737549/121988">How many ways to get an odd number of each color in each bin?</a>, Mathematics Stack Exchange.

%e For n = 3 the a(3) = 4 ways to place five white and five black balls are (wwwwwbbbbb), (wwwbbb)(wb)(wb), (wwwb)(wbbb)(wb), and (wb)(wb)(wb)(wb)(wb).

%t nmax = 15; p = 1; Do[Do[p = Expand[p*(1 - x^(2*i - 1)*y^(2*j - 1))]; p = Select[p, (Exponent[#, x] <= 2*nmax - 1) && (Exponent[#, y] <= 2*nmax - 1) &], {i, 1, 2*nmax - 1}], {j, 1, nmax}]; p = Expand[Normal[Series[1/p, {x, 0, 2*nmax - 1}, {y, 0, 2*nmax - 1}]]]; p = Select[p, Exponent[#, x] == Exponent[#, y] &]; Flatten[{1, Table[Coefficient[p, x^(2*n - 1)*y^(2*n - 1)], {n, 1, nmax}]}] (* _Vaclav Kotesovec_, Apr 16 2018 *)

%Y Cf. A090806, A108469.

%K nonn

%O 1,2

%A _Peter Kagey_, Apr 15 2018

%E More terms from _Vaclav Kotesovec_, Apr 16 2018

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 May 14 02:26 EDT 2024. Contains 372528 sequences. (Running on oeis4.)