For given graphs G and H, the Ramsey number R(G,H) is the least natural number n such that for every graph F of order n the following condition holds: either F contains G or the complement of F contains H. Beaded wheel BW2,m is a graph of order 2m + 1 which is obtained by inserting a new vertex in each spoke of the wheel Wm. In this paper, we determine the Ramsey number of paths versus Beaded wheels: R(Pn,BW2,m) = 2n - 1 or 2n if m ³ 3 is even or odd, respectively, provided n ³ 2m2 - 5m + 4.