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.

A120667 Number of n-node labeled bipartite graphs without isolated nodes.

This page as a plain text file.
%I A120667 #14 May 10 2013 12:45:46
%S A120667 1,0,1,3,22,225,3421,73668,2222977,93033615,5393456986,433396737873,
%T A120667 48429436851577,7548123580987080,1646092439020192801,
%U A120667 503469306031901522043,216430661498688457821022,130959358877474026010486145,111687660283090149155082836341
%N A120667 Number of n-node labeled bipartite graphs without isolated nodes.
%H A120667 Alois P. Heinz, <a href="/A120667/b120667.txt">Table of n, a(n) for n = 0..60</a>
%F A120667 E.g.f.: sqrt( e.g.f. for A052332 ) = sqrt(Sum_{n>=0} exp(x*(2^n-2)) * x^n/n!).
%p A120667 a:= n-> coeff (series (sqrt (add (exp (x*(2^k-2)) *x^k/k!, k=0..n)), x, n+1), x, n)*n!: seq (a(n), n=0..20);  # _Alois P. Heinz_, Sep 12 2008
%Y A120667 Cf. A047864.
%K A120667 easy,nonn
%O A120667 0,4
%A A120667 _Vladeta Jovovic_, Jun 23 2007
%E A120667 More terms from _Alois P. Heinz_, Sep 12 2008