a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.
A124350
a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.
Terms
- a(0) =0a(1) =4a(2) =24a(3) =60a(4) =144a(5) =260a(6) =456a(7) =700a(8) =1056a(9) =1476a(10) =2040a(11) =2684a(12) =3504a(13) =4420a(14) =5544a(15) =6780a(16) =8256a(17) =9860a(18) =11736a(19) =13756a(20) =16080a(21) =18564a(22) =21384a(23) =24380a(24) =27744a(25) =31300a(26) =35256a(27) =39420a(28) =44016a(29) =48836
External references
- oeis: A124350