The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A157051 Number of connected unlabeled non-bipartite graphs on n nodes. 3

%I

%S 0,0,0,1,3,16,95,809,10935,260350,11712539,1006674967,164059617696,

%T 50335905627489,29003487431654737,31397381142185989848,

%U 63969560113210957966315,245871831682083553779103249,1787331725248899067681312999794,24636021429399867654036551645873645,645465483198722799426625560872826564232

%N Number of connected unlabeled non-bipartite graphs on n nodes.

%C Inverse Euler transform of A157016.

%H Andrew Howroyd, <a href="/A157051/b157051.txt">Table of n, a(n) for n = 0..50</a>

%F a(n) = A001349(n) - A005142(n).

%t A001349 = Cases[Import["https://oeis.org/A001349/b001349.txt", "Table"], {_, _}][[All, 2]];

%t A005142 = Cases[Import["https://oeis.org/A005142/b005142.txt", "Table"], {_, _}][[All, 2]];

%t a[n_] := A001349[[n + 1]] - A005142[[n + 1]];

%t a /@ Range[0, 50] (* _Jean-François Alcover_, Sep 21 2019 *)

%K nonn

%O 0,5

%A _Max Alekseyev_, Feb 22 2009

%E a(0) corrected, a(18)-a(20) added by _Max Alekseyev_, Jun 24 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 21 02:10 EDT 2021. Contains 343143 sequences. (Running on oeis4.)