130353
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DUUU's starting at level 1.at n=38A135331
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n)^2, where a(0) = 2, a(1) = 3, b(0) = 1, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=17A296248