On distance-regular graphs with $\lambda=2$

V. P. Burichenko and A. A. Makhnev have found intersection arrays of distance-regular graphs with $\lambda=2$, $\mu>1$, having at most 1000 vertices. Earlier, intersection arrays of antipodal distance-regular graphs of diameter 3 with $\lambda\leqslant2$ and $\mu=1$ were obtained by the second author. In this paper, the possible intersection arrays of distance-regular graphs with $\lambda=2$ and the number of vertices not greater than 4096 are obtained.