81256domain: NAppears in sequencesTriangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of alternating anagrams on n letters (of length 2n) which are decomposable into at most k components.at n=30A239895Numbers which have only digits 0 and 1 in bases 3 and 5.at n=9A268337