I tried working it backwards and ended up with $2+3n$, which is incorrect, and when I work it forwards I et nowhere other than I found that each time in is increased, $A_n$ is increased by $2^{n+1}$. I am not sure how to solve it from there. Help would be appreciated! Thanks.
EDIT: $A_0$ = 1, I'm sorry I typed the wrong number.
hint :"We have not yet learned induction in my discrete mathematics class, and I am not allowed to use it yet. " so you can do this : $$A_{n+1}=2A_{n}+3\\A_{n+1}=2(2A_{n-1}+3)+3=2^2A_{n-1}+6+3\\ A_{n+1}=2^2(2A_{n-2}+3)+9=2^3A_{n-2}+12+6+3\\ A_{n+1}=2^3(2A_{n-3}+3)+12+9\\=2^4A_{n-3}+24+12+6+3\\...$$so $$A_n=a(2^n)+b$$now plug $$A_0,A_1$$ to find $a,b$ $$n=1 \to A_1=a(2^1)+b=5\\n=2 \to A_2=a(2^2)+b=13$$find $a,b$ $$a=4,b=-3\\A_n=4(2^n)-3$$