43086

Appears in sequences

• a(n) = (2*n-1)*(13*n^2-13*n+6)/6.at n=21A063493
• Number of Dyck paths of semilength n+4, having exactly two long ascents (i.e., ascents of length at least two).at n=8A091135
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k long ascents (i.e., ascents of length at least 2). Rows are of length 1,1,2,2,3,3,... .at n=44A091156
• Triangle read by rows: a(n,k) = number of permutations in S_n which avoid the pattern 123 and have exactly k descents.at n=76A166073
• Alternating sums of the ordered Bell numbers (number of preferential arrangements) A000670.at n=7A217388
• Number of partitions of n such that m(greatest part) < m(1), where m = multiplicity.at n=43A240076
• Numbers k such that 3*153479820268467961^2*2^k + 1 is prime.at n=5A361900
• Number of fixed n-polysticks (or polyedges) in 3 dimensions.at n=5A365560
• G.f. satisfies A(x) = ( 1 + x * (1 + x*A(x)^3)^2 )^2.at n=7A371610
• Square array read by antidiagonals: T(n,d) is the number of fixed d-dimensional polysticks of size n.at n=33A385581