1480050

Appears in sequences

• a(n) = 5*binomial(n, 6).at n=27A000910
• Sum of lists created by n substitutions k -> Range[k+1,0,-2] starting with {0}, counting down from k+1 to 0 step -2.at n=18A084081
• Number of noncrossing connected graphs on n nodes having exactly two interior faces.at n=6A089433
• Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=38A089434
• Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=39A089434
• Expansion of 1/(1 - 4*x^2 - 4*x^3)^(3/2).at n=16A377186