38916

Appears in sequences

• a(n) = floor(C(n,4)/5).at n=48A011795
• a(n) = 2^(n-1)*(4*n-6) + 4.at n=11A048497
• a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=44A051170
• Coefficients of (1 + 144*x)^(1/24).at n=3A106206
• a(n) = Sum_{i=1..n} (3i)^2.at n=23A220443
• a(n) = binomial(n+4,4)*gcd(n,5)/5.at n=44A234042
• a(n) = 9*binomial(10*n+9,n)/(10*n+9).at n=4A234573
• a(n) = binomial(5*n+8, 4)/5 for n >= 0.at n=8A238473
• Number of n X 6 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=8A281203
• Antidiagonal sums of the array defined in A385623.at n=36A385624