document.write( "Question 1177677: According to the following sequence how to find the nth term\r
\n" );
document.write( "\n" );
document.write( "1, 2, 3, 6, 11, 20, 37, 68, … \n" );
document.write( "
Algebra.Com's Answer #806781 by greenestamps(13200)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "TRIbonacci numbers -- like Fibonacci numbers except each term is the sum of the preceding THREE terms: \n" ); document.write( "first three numbers 1, 2, 3; \n" ); document.write( "each subsequent term is the sum of the preceding three terms \n" ); document.write( "1 \n" ); document.write( "2 \n" ); document.write( "3 \n" ); document.write( "1+2+3=6 \n" ); document.write( "2+3+6=11 \n" ); document.write( "3+6+11=20 \n" ); document.write( "6+11+20=37 \n" ); document.write( "11+20+37=68 \n" ); document.write( "... \n" ); document.write( "You can use the recursive definition to find as many terms as you want. \n" ); document.write( "I don't believe there is an explicit formula for the n-th term. \n" ); document.write( " \n" ); document.write( " |