1808352

Appears in sequences

• Irregular triangular array read by rows: T(n,k) is the number of 2-colored simple labeled graphs on n nodes that have exactly k edges, 0<=k<=A002620(n), n>=1.at n=62A241669
• If n=0 then 1 otherwise 16*(1+22*A318935(n))*(sum of cubes of odd divisors of n).at n=17A318938