a(n) is the number of ways to place non-attacking knights on a 3 X n chessboard.

A321251

a(n) is the number of ways to place non-attacking knights on a 3 X n chessboard.

Terms

    a(0) =1a(1) =8a(2) =36a(3) =94a(4) =278a(5) =1062a(6) =3650a(7) =11856a(8) =39444a(9) =135704a(10) =456980a(11) =1534668a(12) =5166204a(13) =17480600a(14) =58888528a(15) =198548648a(16) =669291696a(17) =2258436248a(18) =7613387344a(19) =25676313144a(20) =86575342536a(21) =291991130840a(22) =984557555352

External references