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”).

A128526
Number of 4-indecomposable (connected) graphs on n nodes.
3
1, 1, 1, 2, 6, 21, 112, 853, 111, 181, 323, 437, 717, 1198, 1606, 2454, 3782, 4997, 7245, 10543, 13711, 19092, 26612, 34076, 45948, 61930, 78154, 102654, 134670, 167688, 215496, 276480, 340080, 429030, 540246, 657162, 815994, 1011264, 1217712, 1491336, 1822920, 2174898, 2631618, 3178230, 3760086, 4501332, 5378868, 6314748, 7487964, 8863635
OFFSET
1,4
COMMENTS
See A124593 for definition.
FORMULA
G.f.: x/((1-x)*(1-x^2)^2*(1-x^3)^8) + 1 - x^3 - 5*x^4 + 7*x^5 + 82*x^6 + 783*x^7 + 17*x^8 + 10*x^9.
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved