document.write( "Question 1168274: what is the first five terms and 50th term of this sequence.
\n" );
document.write( "An=2a n-1 + 5 and a1=3 \n" );
document.write( "
Algebra.Com's Answer #851626 by Edwin McCravy(20055)![]() ![]() You can put this solution on YOUR website! \r\n" ); document.write( "I wrote a program in LibertyBasic using the given recursion formula\r\n" ); document.write( "and greenestamps' general formula. Here is the LibertyBasic progrem:\r\n" ); document.write( "\r\n" ); document.write( " for n=1 to 50\r\n" ); document.write( " if n=1 then a=3: goto 1\r\n" ); document.write( " a=2*a+5\r\n" ); document.write( "1 print n, a, 2^(n+2)-5\r\n" ); document.write( " next\r\n" ); document.write( "\r\n" ); document.write( "They are identical, as you can see from the complete output below. However, the\r\n" ); document.write( "50th term does not agree with greenestamps' 50th term. He made a slight\r\n" ); document.write( "calculator error and got the 51st term by calculating 2^53-5 instead of 2^52-5.\r\n" ); document.write( "\r\n" ); document.write( " 2a(n-1)-5\r\n" ); document.write( " a(1)=3 a(n)=2n+2-5 \r\n" ); document.write( "1 3 3\r\n" ); document.write( "2 11 11\r\n" ); document.write( "3 27 27\r\n" ); document.write( "4 59 59\r\n" ); document.write( "5 123 123\r\n" ); document.write( "6 251 251\r\n" ); document.write( "7 507 507\r\n" ); document.write( "8 1019 1019\r\n" ); document.write( "9 2043 2043\r\n" ); document.write( "10 4091 4091\r\n" ); document.write( "11 8187 8187\r\n" ); document.write( "12 16379 16379\r\n" ); document.write( "13 32763 32763\r\n" ); document.write( "14 65531 65531\r\n" ); document.write( "15 131067 131067\r\n" ); document.write( "16 262139 262139\r\n" ); document.write( "17 524283 524283\r\n" ); document.write( "18 1048571 1048571\r\n" ); document.write( "19 2097147 2097147\r\n" ); document.write( "20 4194299 4194299\r\n" ); document.write( "21 8388603 8388603\r\n" ); document.write( "22 16777211 16777211\r\n" ); document.write( "23 33554427 33554427\r\n" ); document.write( "24 67108859 67108859\r\n" ); document.write( "25 134217723 134217723\r\n" ); document.write( "26 268435451 268435451\r\n" ); document.write( "27 536870907 536870907\r\n" ); document.write( "28 1073741819 1073741819\r\n" ); document.write( "29 2147483643 2147483643\r\n" ); document.write( "30 4294967291 4294967291\r\n" ); document.write( "31 8589934587 8589934587\r\n" ); document.write( "32 17179869179 17179869179\r\n" ); document.write( "33 34359738363 34359738363\r\n" ); document.write( "34 68719476731 68719476731\r\n" ); document.write( "35 137438953467 137438953467\r\n" ); document.write( "36 274877906939 274877906939\r\n" ); document.write( "37 549755813883 549755813883\r\n" ); document.write( "38 1099511627771 1099511627771\r\n" ); document.write( "39 2199023255547 2199023255547\r\n" ); document.write( "40 4398046511099 4398046511099\r\n" ); document.write( "41 8796093022203 8796093022203\r\n" ); document.write( "42 17592186044411 17592186044411\r\n" ); document.write( "43 35184372088827 35184372088827\r\n" ); document.write( "44 70368744177659 70368744177659\r\n" ); document.write( "45 140737488355323 140737488355323\r\n" ); document.write( "46 281474976710651 281474976710651\r\n" ); document.write( "47 562949953421307 562949953421307\r\n" ); document.write( "48 1125899906842619 1125899906842619\r\n" ); document.write( "49 2251799813685243 2251799813685243\r\n" ); document.write( "50 4503599627370491 4503599627370491\r\n" ); document.write( "\r\n" ); document.write( "Edwin\n" ); document.write( " |