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.

A054931 Number of unlabeled connected graphs up to complementarity.

This page as a plain text file.
%I A054931 #19 Aug 26 2019 12:41:10
%S A054931 1,0,0,1,5,34,331,4949,123764,5713987,497201633,81514244540,
%T A054931 25084892188043,14476409634230317,15684138157859087576,
%U A054931 31969052260961397580693,122903899605317560183278680,893542862676093238616261481156,12317116802837365393131147013965260
%N A054931 Number of unlabeled connected graphs up to complementarity.
%H A054931 Andrew Howroyd, <a href="/A054931/b054931.txt">Table of n, a(n) for n = 1..50</a>
%H A054931 V. A. Liskovets, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/LISK/Derseq.html">Some easily derivable sequences</a>, J. Integer Sequences, 3 (2000), #00.2.2.
%F A054931 a(n) = A001349(n) - (1/2)*A000088(n) + (1/2)*A000171(n). (see Eq. (4) in Liskovets) - _Emeric Deutsch_, Nov 18 2004
%t A054931 A001349 = Cases[Import["https://oeis.org/A001349/b001349.txt", "Table"], {_, _}][[All, 2]];
%t A054931 A000088 = Cases[Import["https://oeis.org/A000088/b000088.txt", "Table"], {_, _}][[All, 2]];
%t A054931 A000171 = Cases[Import["https://oeis.org/A000171/b000171.txt", "Table"], {_, _}][[All, 2]];
%t A054931 a[n_] := A001349[[n+1]] - (1/2) A000088[[n+1]] + (1/2) A000171[[n]];
%t A054931 Array[a, 50] (* _Jean-François Alcover_, Aug 26 2019 *)
%Y A054931 Cf. A001349, A000088, A000171.
%K A054931 nonn,easy
%O A054931 1,5
%A A054931 _N. J. A. Sloane_, May 24 2000
%E A054931 More terms from _Emeric Deutsch_, Nov 18 2004
%E A054931 Terms a(18) and beyond from _Andrew Howroyd_, Sep 17 2018