420732

Appears in sequences

• Fermat coefficients.at n=12A000973
• Number of dissections of a polygon: binomial(4*n, n)/(3*n + 1).at n=8A002293
• a(n) = floor(binomial(n,7)/8).at n=32A011844
• Irreducible Euler sums of weight 8 and depth 10+2n.at n=24A031164
• Number of necklaces with 8 black beads and n-8 white beads.at n=25A032193
• a(n) = ceiling(binomial(n,8)/n).at n=32A053731
• A sequence related to numeric partitions and Fermat Coefficients.at n=25A059251
• Third level generalization of Catalan triangle (0th level is Pascal's triangle A007318; first level is Catalan triangle A009766; 2nd level is A069269).at n=44A069270
• Length of lists created by n substitutions k -> Range[k+1,1,-3] starting with {1}, counting down from k+1 to 1 step -3.at n=23A084080
• Inverse of Riordan array (1/(1-x), x/(1-x)^4), A109960.at n=36A109962
• a(3n+k) = (k+1)*binomial(4n+k, n)/(3n+k+1), where k is n reduced mod 3.at n=24A124753
• Generalized or s-Catalan numbers.at n=39A137211
• Triangle of Generalized Runyon numbers R_{n,k}^(4) read by rows.at n=35A173621
• Numerators of a series sum related to a game of chance.at n=8A181784
• Triangle T(n,m) read by rows, obtained from [A(x)]^m = Sum_{n>=m} T(n,m)*x^n, where A(x) (the g.f. for A069271) satisfies 2*x^2*A(x)^3 = 1 - 2*x*A(x) - sqrt(1-4*x*A(x)).at n=37A188108
• a(n) = binomial(8*n, 2*n) / (6*n + 1).at n=4A235536
• Triangle read by rows: the x = 1+q Narayana triangle at m=3.at n=28A243661
• Triangle read by rows: the reversed x = 1+q Narayana triangle at m=3.at n=28A243663
• Number of Dyck paths of semilength n having exactly eight (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1).at n=23A243777
• The Fuss-Catalan triangle of order 3, read by rows. Related to quartic trees.at n=44A355174