login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of 6-indecomposable (connected) graphs on n nodes.
3

%I #4 Mar 30 2012 17:21:02

%S 1,1,1,2,6,21,112,853,11117,261080,11716571,1006700565,164159,422662,

%T 1295037,4272969,12780650,23303620,64379033,189490870,556338383,

%U 1448500351,2871171041,7624849834,20914847051,55714746424,133364472272,277569288280,708402263349,1827946074290,4530654263579,10312511072061,22005420425661,54057174050076,132409684714581

%N Number of 6-indecomposable (connected) graphs on n nodes.

%C See A124593 for definition.

%F G.f.: x/((1-x)*(1-x^2)^2*(1-x^3)^8*(1-x^4)^44*(1-x^5)^333) + 1 - x^3 - 5*x^4 - 37*x^5 - 295*x^6 + 318*x^7 + 9540*x^8 + 255640*x^9 + 11694624*x^10 + 1006613825*x^11 + 25539*x^12 + 25593*x^13 + 30877*x^14 + 34220*x^15

%Y Cf. A126099, A128526, A128527

%K nonn

%O 1,4

%A _David Applegate_ and _N. J. A. Sloane_, Mar 07 2007