24460

Appears in sequences

• Number of rooted polyhedral graphs with n edges.at n=10A000287
• Number of partitions of floor(7n/2) into n nonnegative integers each no more than 7.at n=21A001979
• Number of partitions satisfying (cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=41A036801
• a(n) = A000930(n) + A000930(n+3) + 4.at n=24A170933
• A triangle formed like Pascal's triangle, but with 5^n on the borders instead of 1.at n=38A227076
• A triangle formed like Pascal's triangle, but with 5^n on the borders instead of 1.at n=42A227076
• Number of nX3 0..1 arrays with every element equal to 0, 1, 2 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=9A302618