176397
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....at n=29A089435
- Twin prime products minus 2.at n=21A124659
- Triangle T(n,k) = 4*binomial(n,k)^2 - 3, read by rows, 0<=k<=n.at n=59A141596
- Triangle T(n,k) = 4*binomial(n,k)^2 - 3, read by rows, 0<=k<=n.at n=61A141596