login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A048179
Number of graphs with n nodes and n+1 edges.
4
1, 6, 24, 97, 402, 1637, 6759, 28259, 119890, 517121, 2271860, 10176660, 46541024, 217511951, 1039651295, 5084972068, 25458149446, 130480742790, 684550272269, 3675258986639, 20184618368312, 113340974676578, 650343587802644
OFFSET
4,2
REFERENCES
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 146.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 4..50 (terms 4..37 from Sean A. Irvine)
M. L. Stein and P. R. Stein, Enumeration of Linear Graphs and Connected Linear Graphs up to p = 18 Points. Report LA-3775, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, Oct 1967.
FORMULA
a(n) = A008406(n, n+1). - Andrew Howroyd, Jan 09 2024
PROG
(PARI) a(n) = polcoef(G(n, O(x^(n+2))), n+1) \\ G defined in A008406. - Andrew Howroyd, Jan 09 2024
CROSSREFS
Cf. A008406.
Sequence in context: A164908 A290911 A037505 * A117614 A037688 A378497
KEYWORD
nonn,easy,nice
EXTENSIONS
More terms from Vladeta Jovovic, Jan 07 2000
More terms from Sean A. Irvine, Jun 06 2017
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy