login

Revision History for A219555

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of bipartite partitions of (i,j) with i+j = n into distinct pairs.
(history; published version)
#30 by OEIS Server at Thu Sep 19 20:48:10 EDT 2019
LINKS

Alois P. Heinz, <a href="/A219555/b219555_3.txt">Table of n, a(n) for n = 0..8000</a> (terms n=101..1000 from Vaclav Kotesovec)

#29 by Alois P. Heinz at Thu Sep 19 20:48:10 EDT 2019
STATUS

editing

approved

Discussion
Thu Sep 19
20:48
OEIS Server: Installed new b-file as b219555.txt.  Old b-file is now b219555_3.txt.
#28 by Alois P. Heinz at Thu Sep 19 20:48:02 EDT 2019
LINKS

Alois P. Heinz and Vaclav Kotesovec, , <a href="/A219555/b219555_3.txt">Table of n, a(n) for n = 0..10008000</a> (first 100 terms n=101..1000 from Alois P. HeinzVaclav Kotesovec)

#27 by Alois P. Heinz at Thu Sep 19 17:07:51 EDT 2019
MAPLE

b(n-i*j, min(n-i*j, i-1), k)*binomial(i+1, j), j=0..n/i)))

#26 by Alois P. Heinz at Thu Sep 19 17:03:06 EDT 2019
MAPLE

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0, add(

`if` b(n-i*j, min(n-i*j, i<-1, 0, add(binomial(), k)*binomial(i+1, ij), j=0..n/i)))*

b(n-i*j, min(n-i*j, i-1), k), j=0..n/i)))

#25 by Alois P. Heinz at Thu Sep 19 16:48:57 EDT 2019
MAPLE

b:= proc(n, i) option remember; `if`(n=0, 1,

`if`(i<1, 0, add(binomial(binomial(i+1, i), j)*

b(n-i*j, min(n-i*j, i-1), k), j=0..n/i)))

end:

a:= n-> b(n$2):

seq(a(n), n=0..42); # Alois P. Heinz, Sep 19 2019

STATUS

approved

editing

#24 by Susanna Cuyler at Sat Aug 11 21:56:53 EDT 2018
STATUS

proposed

approved

#23 by Ilya Gutkovskiy at Sat Aug 11 18:01:51 EDT 2018
STATUS

editing

proposed

#22 by Ilya Gutkovskiy at Sat Aug 11 17:41:44 EDT 2018
FORMULA

G.f.: exp(Sum_{k>=1} (-1)^(k+1)*x^k*(2 - x^k)/(k*(1 - x^k)^2)). - Ilya Gutkovskiy, Aug 11 2018

STATUS

approved

editing

#21 by OEIS Server at Sun Mar 08 04:10:38 EDT 2015
LINKS

Alois P. Heinz and Vaclav Kotesovec, <a href="/A219555/b219555_2.txt">Table of n, a(n) for n = 0..1000</a> (first 100 terms from Alois P. Heinz)