Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.

A108509

Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.

Terms

    a(0) =1a(1) =5a(2) =20a(3) =100a(4) =480a(5) =1980a(6) =7680a(7) =29040a(8) =100920a(9) =316320a(10) =923520a(11) =2502000a(12) =6011760a(13) =12584880a(14) =23417280a(15) =38196480a(16) =50112000a(17) =53667840a(18) =64988160a(19) =64988160

External references