Triangle read by rows: T(n,k) is the number of graphs with n vertices and bandwidth k.

Terms

a(0) =1a(1) =2a(2) =3a(3) =1a(4) =5a(5) =5a(6) =1a(7) =7a(8) =18a(9) =8a(10) =1a(11) =11a(12) =60a(13) =70a(14) =14a(15) =1a(16) =15a(17) =195a(18) =580a(19) =233a(20) =20a(21) =1a(22) =22a(23) =623a(24) =4942a(25) =5902a(26) =826a(27) =30a(28) =1a(29) =30