87516

Appears in sequences

• Number of ways of partitioning n points on a circle into subsets only of sizes 2 and 3.at n=17A001005
• 3-dimensional Catalan numbers.at n=6A005789
• Expansion of 1/(1-4*x)^(9/2).at n=5A020920
• Theta series of A*_17 lattice.at n=80A023929
• a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n and s(0) = 3. Also a(n) = Sum{T(n,k), k = 0,1,...,[ (n+3)/2 ]}, where T is defined in A026022.at n=17A026023
• Distinct even elements in the 5-Pascal triangle A028313.at n=44A028320
• Even elements to the right of the central elements of the 5-Pascal triangle A028313.at n=34A028321
• Array T(i,j) = binomial(-1/2-i,j)*(-4)^j, i,j >= 0 read by antidiagonals going down.at n=49A046521
• Array T(m,n) read by antidiagonals: T(m,n) (m >= 1, n >= 1) = number of ways to arrange the numbers 1,2,...,m*n in an m X n matrix so that each row and each column is increasing.at n=33A060854
• Array T(m,n) read by antidiagonals: T(m,n) (m >= 1, n >= 1) = number of ways to arrange the numbers 1,2,...,m*n in an m X n matrix so that each row and each column is increasing.at n=30A060854
• Triangle read by rows: T(n,m) = C[n,m,m] where C[i,j,k] is the 3-dimensional Catalan pyramid defined by C[0,0,0]=1 and C[i,j,k]=0 if j>i or k>j and C[i,j,k]=C[i-1,j,k]+C[i,j-1,k]+C[i,j,k-1].at n=27A065077
• Triangle read by rows: T(n,k) is the number of 2-stack sortable n-permutations with k runs.at n=58A082680
• Triangle read by rows: T(n,k) is the number of 2-stack sortable n-permutations with k runs.at n=62A082680
• Triangle read by rows: T(n,k) = (2 * (binomial(n,k)) * (n + 2 * k + 3)!)/((k + 1)! * (k + 2)! * (n + 3)!).at n=20A087727
• Triangle read by rows: T(n,k) is the number of standard tableaux of shape (n,n,k) (0<=k<=n).at n=26A094236
• Triangle read by rows: T(n,k) is the number of standard tableaux of shape (n,n,k) (0<=k<=n).at n=27A094236
• Eighth column (m=7) of (1,3)-Pascal triangle A095660.at n=12A095663
• Primitive elements of A096490.at n=27A118671
• Distinct values in A114717 in order of appearance.at n=16A119841
• Number of claw-free Berge perfect graphs on n nodes.at n=10A123413