1061520domain: NAppears in sequencesTriangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2 starting at an odd level (0<=k<=floor(n/2)-1 for n>=2; k=0 for n=0,1).at n=45A114463(101^n,1)-Pascal triangle.at n=24A164866Floor( ( n + 1/n )^6 ).at n=9A197605Round((n+1/n)^6).at n=9A198071