document.write( "Question 498943: Hello:\r
\n" ); document.write( "\n" ); document.write( "I am working on a practice test and it would be dishonest of me to ask you the same question. However, I am having a horrible time discerning how to write a recursive pattern. I know how to find the pattern, no problem, see that right away, but when it comes to figuring out the pattern I get a mental block. \r
\n" ); document.write( "\n" ); document.write( "Is there a resource you can recommend to me to sort this out? I would be happy to study it as I want to understand this.\r
\n" ); document.write( "\n" ); document.write( "Tina \r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #337253 by chessace(471)\"\" \"About 
You can put this solution on YOUR website!
There are several books, no doubt some of them online.
\n" ); document.write( "It's easy enough to explain:
\n" ); document.write( "Once you see the pattern, say it's
\n" ); document.write( "1 3 7 15 31 ...
\n" ); document.write( "which you see is \"double previous then add 1\",
\n" ); document.write( "The recusive formula is not far off:
\n" ); document.write( "x(1)=1
\n" ); document.write( "for n>1, x(n)=2*x(n-1)+1
\n" ); document.write( "Even sequences that are \"too easy\" such as the even numbers,
\n" ); document.write( "can be expressed recursively:
\n" ); document.write( "x(1)=2
\n" ); document.write( "n>1: x(n)=x(n-1)+2
\n" ); document.write( "
\n" ); document.write( "
\n" );