45647

Appears in sequences

• a(n) = Sum_{k=1..n} binomial(n,k) * gcd(n,k) * a(k-1), with a(0) = 1.at n=7A159666
• Number of squares of all sizes in 3*n*(n+1)/2-ominoes in form of three-quarters of Aztec diamonds.at n=48A258440
• Number of asymmetric characteristic solutions to the n-queens problem.at n=13A260320
• Number of partitions of the (n+2)-multiset {0,...,0,1,2} with n 0's into distinct multisets.at n=37A346822