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.

A094602 Total number of edges in all connected unlabeled graphs on n nodes.

This page as a plain text file.
%I A094602 #6 Feb 01 2020 22:35:32
%S A094602 0,1,5,25,130,951,9552,160220,4756703,264964172,27746801125,
%T A094602 5419696866001,1964101824992259,1319988856541150115,
%U A094602 1648566523004692022634,3838409698542815296758222,16719797018733808721401666187,136732968429033400292302529059213
%N A094602 Total number of edges in all connected unlabeled graphs on n nodes.
%H A094602 Andrew Howroyd, <a href="/A094602/b094602.txt">Table of n, a(n) for n = 1..50</a>
%F A094602 a(n) = Sum_{k=1..binomial(n,2)} k*A054924(n, k). - _Andrew Howroyd_, Feb 01 2020
%o A094602 (PARI) \\ See A054923 for G, InvEulerMT.
%o A094602 a(n)={subst(deriv(InvEulerMT(vector(n, k, G(k,y)))[n]), y, 1)} \\ _Andrew Howroyd_, Feb 01 2020
%Y A094602 Cf. A046751, A054923, A054924, A086314, A095351.
%K A094602 nonn
%O A094602 1,3
%A A094602 _Vladeta Jovovic_, Jun 06 2004
%E A094602 Terms a(17) and beyond from _Andrew Howroyd_, Feb 01 2020