Number of connected k-regular graphs on 2*n nodes with maximal diameter D(n,k) A296525 written as array T(n,k), 2 <= k < 2*n.

A296526

Number of connected k-regular graphs on 2*n nodes with maximal diameter D(n,k) A296525 written as array T(n,k), 2 <= k < 2*n.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =1a(7) =3a(8) =6a(9) =3a(10) =1a(11) =1a(12) =1a(13) =1a(14) =35a(15) =60a(16) =21a(17) =5a(18) =1a(19) =1a(20) =1a(21) =2a(22) =16a(23) =2391a(24) =7849a(25) =1547a(26) =94a(27) =9a(28) =1a(29) =1

External references