771066domain: NAppears in sequencesTriangle T(n, k) read by rows: T(0, 0) = 1 and T(n, k) = Sum_{i=0..k-1} T(n, i) + Sum_{i=k..n-1} T(n-1, i).at n=23A318301a(n) is the number of subsets of {1,2,...,n} with at least two elements and the difference between successive elements at least 6.at n=52A335184