The number of different $$n$$ $$x$$ $$n$$ symmetric matrices with each elements being either $$0$$ or $$1$$ is (Note: power ($$2,$$ $$x$$) is same as $${2^x}$$)

Consider the following relations:
$${R_1}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,\left( {a + b} \right)$$ is even over the set of integers
$${R_2}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,\left( {a + b} \right)$$ is odd over the set of integers
$${R_3}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,a.b > 0$$ over the set of non-zero rational numbers
$${R_4}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,\left| {a - b} \right| \le 2$$ over the set of natural numbers

Which of the following statements is correct?

The number of binary relations on a set with $$n$$ elements is:

Suppose $$A$$ is a finite set with $$n$$ elements. The number of elements in the Largest equivalence relation of $$A$$ is