cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A122802 Number of labeled bipartite graphs on n vertices with no isolated vertices.

Original entry on oeis.org

1, 0, 1, 6, 29, 510, 5032, 161406, 3294405, 194342910, 7934652356, 881008805886, 71275547085536, 15178191426486270, 2434250064518832302, 1008694542117649154046, 321680912414994434144165, 262063364967549826752315390, 166681427053102507699172431372
Offset: 0

Views

Author

Max Alekseyev, Sep 11 2006

Keywords

Crossrefs

Programs

  • PARI
    a(n)={sum(k=0, n, binomial(n, k)*(2^k-2)^(n-k)) - if(n%2==0&&n>0, binomial(n-1, n/2)*sum(k=0, n/2, binomial(n/2, k)*(-1)^k*(2^(n/2-k)-1)^(n/2)))} \\ Andrew Howroyd, Nov 07 2019

Formula

a(2n+1) = A052332(2n+1); a(2n) = A052332(2n) - A122801(n) for n > 0.

Extensions

Terms a(17) and beyond from Andrew Howroyd, Nov 07 2019
Showing 1-1 of 1 results.