24308

Appears in sequences

• Number of asymmetric (identity) trees with n nodes and 8 leaves.at n=6A055339
• Expansion of g.f. x*(1 +30*x +49*x^2 -71*x^3 -116*x^4)/((1+2*x)*(1-2*x^2) *(1-2*x-4*x^2)).at n=7A121960
• Number of n X 8 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=8A166813
• a(n) = binomial(n, [n/2]) - 2.at n=17A201686
• Number of (n+7)X1 arrays of occupancy after each element moves up to +-7 places including 0.at n=1A222344
• T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places including 0.at n=29A222345
• Number of (n+2) X 1 arrays of occupancy after each element moves up to +-n places including 0.at n=6A222346
• Partial sums of A006950.at n=38A233969
• Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UUDDUDUUUUDUDDDDUUDD (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-2)/8)), read by rows.at n=27A242450
• Number of dihedral Carlitz compositions of n.at n=24A292906
• Numbers k such that (2*10^k - 23)/3 is prime.at n=18A293000
• a(n) = Sum_{i=1..n} sigma(i)*sigma(i+1), where sigma(n) = A000203(n) is the sum of the divisors of n.at n=29A330322
• Number of sets of nonzero triangular numbers whose largest element is the n-th triangular number and whose sum is a triangular number.at n=20A378961