59115

Appears in sequences

• The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2^n)*(2^n+1)/2, the 2^n -th triangular number. Sequence contains the triangle read by rows.at n=59A112358
• Triangle read by rows: a(1,1) = 1. a(m,m) = sum of all terms in rows 1 through m-1. a(m,n) = a(m-1,n) + (sum of all terms in rows 1 through m-1), for n < m.at n=28A159927
• Triangle read by rows: T(n,k) is the number of graphs with n vertices and skewness k (n >= 1 and k >= 0).at n=30A294224
• a(n) is the number of cyclic permutations that admit a [1,1,-1]-gridding.at n=13A303980
• a(n) is the number of cyclic permutations of length n that admit a [1,-1,-1]-gridding.at n=13A304201