[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A369828
Number of simple graphs on 2n labeled nodes with n edges where each maximally connected subgraph has at most one cycle.
2
1, 1, 15, 455, 20475, 1220499, 90612753, 8055867105, 834505143615, 98716154311775, 13130233759131489, 1939826433518297961, 315169336802124178465, 55852728904993187133225, 10721612205253023622081875, 2216303140328629150998750435, 490841301461498403844464646155
(list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
All terms are odd.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..310
FORMULA
a(n) = A144228(2n,n).
CROSSREFS
Cf. A144228.
Sequence in context: A041423 A041420 A036506 * A306675 A219561 A209488
Adjacent sequences: A369825 A369826 A369827 * A369829 A369830 A369831
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Feb 02 2024
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 26 17:26 EST 2024. Contains 378131 sequences.
License Agreements, Terms of Use, Privacy Policy