239045

Appears in sequences

• a(n) = n + (n-1)*(n-2) + (n-3)*(n-4)*(n-5) + (n-6)*(n-7)*(n-8)*(n-9) + ... + ...*(n-n).at n=23A227363
• a(n) is the number of unlabeled 2-connected graphs with n edges containing at least one pair of nodes with resistance distance 1 when all edges are replaced by unit resistors.at n=14A360031