Here are three different methods. The first one is recommended, the others are just for fun and curiosity.
Combinatorial approach:
We use the coefficient of operator $[x^n]$ to denote the coefficient of $x^n$ of a series. Here we are looking for a positive solution $p$ of
\begin{align*}
60=[x^2](2+px)^6\tag{1}
\end{align*}
Multiplying $(2+px)^6$ out we get a contribution to $x^2$ if and only if we select from two factors $2+px$ the term $px$ giving us $p^2x^2$ and taking from the other $4$ factors $2$ giving us $2^4=16$. Since we can select two factors from $(2+px)^6$ in $\binom{6}{2}$ ways, we obtain
\begin{align*}
\color{blue}{60}=[x^2](2+px)^6=\binom{6}{2}p^22^4=15p^2\cdot 16\color{blue}{=240p^2}
\end{align*}
from which $p=\frac{1}{2}$ follows.
Algebraic approach:
A somewhat cumbersome but simple approach is to iteratively work through the linear factors $2+px$.
We obtain
\begin{align*}
\color{blue}{60}&=[x^2](2+px)^6\\
&=[x^2](2+px)(2+px)^5\\
&=\left(2[x^2]+p[x^1]\right)(2+px)(2+px)^4\tag{1}\\
&=\left(4[x^2]+4p[x^1]+p^2[x^0]\right)(2+px)(2+px)^3\tag{2}\\
&=\left(8[x^2]+12p[x^1]+6p^2[x^0]\right)(2+px)(2+px)^2\\
&=\left(16[x^2]+32p[x^1]+24p^2[x^0]\right)(2+px)(2+px)^1\\
&=\left(32[x^2]+80p[x^1]+80p^2[x^0]\right)(2+px)\\
&=160p^2+80p^2\tag{3}\\
&\,\,\color{blue}{=240p^2}
\end{align*}
from which $p=\frac{1}{2}$ follows.
Comment:
In (1) we use the linearity of the coefficient of operator and apply the rule $[x^p]x^qA(x)=[x^{p-q}]A(x)$.
In (2) and the following lines we determine the coefficients according to the rules from (1), i.e.
\begin{align*}
&\left(a[x^2]+b[x^1]+c[x^0]\right)(2+px)=2a[x^2]+(2b+ap)[x^1]+(2c+bp)[x^0]
\end{align*}
In (3) we select the coefficients accordingly.
Complex analytic approach:
This variant shouldn't be taken too serious. It's just for fun and in fact based on the first method. We recall the residue theorem which tells us that integrating along a circle with radius one around the origin we have
\begin{align*}
[x^2](2+px)^6=\frac{1}{2\pi i}\oint_{|x|=1}\frac{(2+px)^6}{x^3}\,dx
\end{align*}
We obtain
\begin{align*}
\color{blue}{60}&=[x^2](2+px)^6\\
&=\frac{1}{2\pi i}\oint_{|x|=1}\frac{(2+px)^6}{x^3}\,dx\\
&=\frac{1}{2\pi i}\int_{0}^{2\pi}\frac{\left(2+pe^{it}\right)^6}{e^{3it}}\,ie^{it}\,dt\tag{2}\\
&=\frac{1}{2\pi}\int_{0}^{2\pi}\left(2+pe^{it}\right)^6e^{-2it}\,dt\tag{3}\\
&=\frac{1}{2\pi}\int_{0}^{2\pi}\binom{6}{2}2^4p^2\,dt\tag{4}\\
&=\frac{1}{2\pi}\binom{6}{2}2^4p^2\int_{0}^{2\pi}\,dt\\
&\,\,\color{blue}{=240p^2}
\end{align*}
from which $p=\frac{1}{2}$ follows.
Comment:
In (2) we use the substitution $x=e^{it}, dx=ie^{it}dt$.
In (3) we note $\int_{0}^{2\pi}e^{-kit}\,dt =0, k\in \mathbb{Z}$ which is due to Euler's identity $e^{2\pi i}=1$. So, everything vanishes in (3) besides the constant term.
In (4) we select the constant term in fact with the same considerations we used in the first approach.
Note: Another approach might be using shifted series multisection in order to filter the wanted coefficient of $x^2$.