1669120

Appears in sequences

• Binomial transform of A073145: a(n)=Sum(binomial(n,k)*A073145(k),(k=0,..,n)).at n=33A075115
• a(n) = 2^n*tribonacci(n) or (2^n)*A001644(n+1).at n=10A127214
• Triangle read by rows: Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 2k.at n=41A227715