Find number of ways to seat $n$ boys and $n$ girls in a row so that every boy has at least one girl sitting beside him. My attempt: I am getting $2^n(n!)^2$ .

First I paired $n$ boys and $n$ girls in $n!$ ways then these pairs can be arranged in $n!$ ways and in each of these pairs boy and girl can arrange themselves in $2!$ ways.
Begin with seating $n$ indistinguishable girls leaving ample space between and around  them, like so:
$$\ \underline{\ \  }\ G\ \underline{\ \ }\ G\ \underline{\ \ }\ G\ \underline{\ \ }\ \ldots\ \underline{\ \ }\ G\ \underline{\ \ }\ G\ \underline{\ \ }\quad .$$
An admissible seating pattern can then be constructed as follows:


Choose an $r$ with $0\leq2r\leq n$.
Choose $r$ of the $n-1$ inner spaces between the $G$s, and write $B^2$ there. This can be done in ${n-1\choose r}$ ways.
Choose $n-2r$ of the remaining $n+1-r$ spaces, and write a single $B$ there. This can be done in ${n+1-r\choose n-2r}$ ways.


The total number $P(n)$ of admissible seating patterns therefore comes to
$$P(n)=\sum_{r=0}^{\lfloor n/2\rfloor}{n-1\choose r}\&gt;{n+1-r\choose n-2r}\qquad(n\geq1)\ ,$$
producing the sequence $(2,4,10,26,70,192,\ldots)$, as in Markus Scheuer's answer. Making girls as well as boys distinguishable then gives the number
$$N=(n!)^2 P(n)$$
of personalized seatings.
Start with two lines, one of boys and one of girls, and imagine constructing the arrangement by picking the first person in one of the lines. You get a factor of 2 every time the choice can be from either line.

This construction is useful because no seating arrangement is double counted, which can be seen by noting that you can retrieve the order the boys (or girls) were in in their monogender lines by skipping the people of another gender.