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.

A318590 Number of connected balanced simple signed graphs on n unlabeled nodes.

Original entry on oeis.org

1, 1, 2, 5, 28, 177, 1982, 33997, 1020516, 54570672, 5347070228, 967135763525, 324200029119318, 202046821340636691, 234878262433630160622, 511060736355598412146405, 2088401066728281847415734793, 16079824271822965645002329491423, 233994776259866281916838227225733732
Offset: 0

Views

Author

Andrew Howroyd, Sep 25 2018

Keywords

Crossrefs

Formula

a(2*n+1) = A054921(2*n+1)/2, a(2*n) = (a(n) + A054919(n) + A054921(2*n) - A054921(n))/2.
Inverse Euler transform of A034892.