110381

Appears in sequences

• Number of n-node connected unicyclic graphs.at n=12A001429
• Number of simple perfect squared rectangles of order n up to symmetry.at n=17A002839
• Array read by columns: T(n,m) = number of unlabeled graphs with n vertices and m unicyclic components.at n=30A137918
• Number of nonsquare simple perfect squared rectangles of order n up to symmetry.at n=17A219766
• Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3).at n=46A381467
• Numbers k such that k + sopfr(k) is a cube.at n=44A389862