85102
domain: N
Appears in sequences
- Third column of A071223.at n=23A087645
- a(n) = 15 + floor((2 + Sum_{j=1..n-1} a(j))/3).at n=30A120159
- Number of labeled n-node connected graphs with at most one cycle.at n=7A129271
- Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with exactly k components where each component has at most one cycle; n>=1, 1<=k<=n.at n=21A217756
- Number of parts in all proper twice partitions of n into distinct parts.at n=22A327795