54386

Appears in sequences

• Sum of GCD's of parts in all partitions of n.at n=41A078392
• Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).at n=63A360862
• a(n) = (1/4) * Sum_{k=0..n} (k+2) * binomial(2*k+2,2*n-2*k+1).at n=10A391829