503880
domain: N
Appears in sequences
- a(n) = binomial(n+6,6)*(6*n+7)/7.at n=14A034265
- a(n) = (3*n+4)*binomial(n+7, 7)/4.at n=12A054487
- a(n) = 3*binomial(2*n, n-1).at n=10A062561
- a(n) = lcm(1..n) / ((n+1)(n+2)...(n+k)) where k is the largest number which gives an integral value.at n=19A069491
- Triangle of C(n+1,k)*C(2*n-3*k,n-3*k)/(n+1) by rows.at n=37A073187
- Number of ways of arranging n chords on a circle (handshakes between 2n people across a table) with exactly 2 simple intersections.at n=10A074922
- a(n) = lcm{1, 2, ..., n}/(n*(n-1)), n >= 2.at n=20A099946
- Triangle read by rows, where the g.f. satisfies A(x, y) = 1 + x*A(x, y)^2 + x*y*A(x, y)^3.at n=47A104978
- Sum of root degrees of all symmetric ordered trees with n edges.at n=19A143360
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+191)^2 = y^2.at n=14A161486
- Number T(n,k) of modified skew Dyck paths of semilength n with exactly k anti-down steps; triangle T(n,k), n>=0, 0<=k<=n-floor((1+sqrt(max(0,8n-7)))/2), read by rows.at n=45A274404
- Maximum number of copies of a 12345 permutation pattern in an alternating (or zig-zag) permutation of length n + 7.at n=32A339355