85569
domain: N
Appears in sequences
- Draw a line through every pair of points with coordinates (x, 1) and (x', 2) with x, x' in 1..n, and then count the number of intersection points above the line y = 2.at n=33A092275
- Matrix square of triangle A121412.at n=21A121416
- Column 0 of triangle A121416.at n=6A121418
- Rectangular table, read by antidiagonals, where row n is equal to column 0 of matrix power A121412^(n+1) for n>=0.at n=34A121424
- Number of subpartitions of partition P=[0,1,1,2,2,2,3,3,3,3,4,...] (A003056).at n=22A121430
- Square array, read by antidiagonals, where T(n,k) = T(n,k-1) + T(n-1,k+n) for n>0, k>0, such that T(n,0) = T(n-1,n) for n>0 with T(0,k)=1 for k>=0.at n=29A136733
- a(n) = n*(5*n^2-8*n+5)/2.at n=33A226449