A Shilla graph is a distance-regular of diameter 3 that has second eigenvalue equal to = a3 . Koolen and Park found admissible arrays intersections the Shill graphs with b (there were 12 them). Belousov I.N. feasible intersection 4 50 them) 5 82 It proved in paper Schill {305,248,62;1,2,244}, {315,256,64;1,2,252}, {345,280,64;1,4,276},{615,496,124;1,4,492}, {815,656,164;1,2,652}, {855,688,172;1...