Best Answer

tn = t1+(n-1)d -- for arithmetic

tn = t1rn-1 -- for geometric

More answers

hat is the next number in the series: 60 30 20 15 12

Q: How do you find the nth number in a sequence?

Write your answer...

Submit

Still have questions?

Continue Learning about Engineering

The Nusselt number is proportional to the Prandtl number to the nth power, where n is a positive number less than one.

A brief description allowing the reader to identify the image and its significance, and a figure number correlating to the sequence of images in the book

Type this into Dev-C++ and run it. You will be able to find whatever harmonic number you want. This may not be perfect because I wrote it in about 10 minutes, but I think it works just fine. Good luck!#include double seq(double x);double seq(double x) {double temp=0;if (x==0)return 0;return 1/x + seq(x-1);}int main() {double x, y;while (x != 0) {printf("Please enter a number:\n");scanf("%lf", &x);y = seq(x);printf("The sequence of that number is: %lf\n", y);}system("PAUSE");return 0;}

<html> <body> <script type="text/vbscript"> Dim a, b, c, n, nth a = 0 b = 1 n = Cint(InputBox("Enter the value of ""n""")) For nth = 1 to n Step 1 Document.Write(b&"<br/>") c = a + b a = b b = c Next </script> </body> </html>

In a Fibonacci sequence, sum of two successive terms gives the third term.... here is the Fibonacci sequence: 0,1,1,2,3,5,8,13,21,34,55,89,144........ General formula to generate a Fibonacci sequence is """Fn= Fn-1 + Fn-2""" To check whether a number is Fibonacci or not follow the following steps: 1) Get the number as input from user. 2) Fix the first two numbers of sequence as 0 and 1. 3) put a sentinel loop with upper limit being the input number. 4)in the body of loop generate the next number in sequence in each iteration and continue swapping the values as follows: a=0 b=1 next=a+b while (next< input) a=b b=next next=a+b wend 5) lastly when program exits the loop compare the last number of sequence with the input number if they are equal then number is Fibonacci otherwise not. otherwise the last term of sequence will be less than the input number.

Related questions

Each number in this sequence is twice the previous number. The nth. term is 2n-1.Each number in this sequence is twice the previous number. The nth. term is 2n-1.Each number in this sequence is twice the previous number. The nth. term is 2n-1.Each number in this sequence is twice the previous number. The nth. term is 2n-1.

Three or more terms of a sequence are needed in order to find its nth term.

A single number, such as -3052 cannot define a sequence and, without a sequence you cannot have an nth term.

The single number 37111519 does not comprise a sequence.A single number such as 37111519 does not constitute a sequence and so there can be no nth term.

The question does not contain a sequence but a single large number whose digits are the digits of the sequence, 3n run together. There is only one number, not a sequence, so there is no nth term.

A single number, such as 235711, does not constitute a sequence.

A single number, such as 626126626 does not define a sequence.

A single number, such as 44444, does not define a sequence.

what? Assuming you wanted an algorithm to find the nth number in the Fibonacci sequence: double Fib(int i) { double x = 1; double y = 1; if (i

Given n and any number for the nth term, it is a simple matter to find a rule such that the above four numbers are the first four of a sequence and the given number in the nth position.However, the simple answer for simple questions is Un = 4n

a nth term in a sequence is more easy then u think first find a sequence lets say like 1,5,9,13,17 all u do is find what you add to the number to get the next and to make sure its right all the way through just do the last one so this sequence is add 4 simple

The nth term of the sequence is 3n - 2.