126815

Appears in sequences

• a(0)=1, a(1)=1; for n>1, a(n) = Sum_{i=0..n/2} binomial(n-i-1,i)*a(n-2i-1) + ((n+1) mod 2).at n=14A079512
• Smallest integer m > 1 such that m!^(m + n) divides (m^2)!.at n=13A244443