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.

A369828 Number of simple graphs on 2n labeled nodes with n edges where each maximally connected subgraph has at most one cycle.

This page as a plain text file.
%I A369828 #7 Feb 02 2024 19:22:50
%S A369828 1,1,15,455,20475,1220499,90612753,8055867105,834505143615,
%T A369828 98716154311775,13130233759131489,1939826433518297961,
%U A369828 315169336802124178465,55852728904993187133225,10721612205253023622081875,2216303140328629150998750435,490841301461498403844464646155
%N A369828 Number of simple graphs on 2n labeled nodes with n edges where each maximally connected subgraph has at most one cycle.
%C A369828 All terms are odd.
%H A369828 Alois P. Heinz, <a href="/A369828/b369828.txt">Table of n, a(n) for n = 0..310</a>
%F A369828 a(n) = A144228(2n,n).
%Y A369828 Cf. A144228.
%K A369828 nonn
%O A369828 0,3
%A A369828 _Alois P. Heinz_, Feb 02 2024