145957593600domain: NAppears in sequencesa(n) = F(n+2)*(Product_{i=1..n+1} F(i))^2 where F(i)=A000045(i) is the i-th Fibonacci number.at n=7A067962Number of ascending runs of length n in the permutations of [2n].at n=9A230382