Best Answer

Here is a rule (which works in English, but perhaps in no other language) to recover the desired sequence: 0=zero, 1=one, 2=two, 3=three, 4=four, 5=five, 6=six, 7=seven, 8=eight, 9=nine. Now rearrange in inverse alphabetical order: zero=0, two=2, three=3, six=6, seven=7, one=1, nine=9, four=4, five=5, eight=8.

You can also use an interpolating polynomial, which summarises the values in a single formula. If x takes on values from 1 to 6, the sequence can be recovered with:

((((6x-119)x+801)x-2194)x+2280)(x-1)/120

There may be better ways to generate the 6 numbers.

Q: 0 2 3 6 7 1 sequence?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

12110 0r 1210

The Fibonacci Series is a sequence of numbers produced by adding the last two numbers to get the next. It arbitrarily starts with 0, 1. The first few terms are: 0, 1, 1, 2, 3, 5, 8, 13 ... after 0, 1 these are generated by 0+1=1 1+1=2 2+1=3 2+3=5 3+5=8

It is almost the Fibonacci sequence, which is 0 1 1 2 3 5 8 13 21 34 55 ...1 + 2 = 32 + 3 = 53 + 5 = 85 + 8 = 13So, the sequence is 1 2 3 5 8 13

The pattern for the sequence 0 0 1 3 6 is that each term is obtained by adding the previous term multiplied by its position in the sequence (starting from 1). In other words, the nth term is given by n*(n-1)/2.

The next four number in the sequence are... 4,5,5 & 6

Related questions

The general term for the sequence 0, 1, 1, 2, 2, 3, 3 is infinite sequence.

The rule of the Fibonacci sequence is simple. Take the previous number in the sequence, and add it to the current number. The sequence starts with 0 and 1. 0, 1 So, add 0+1=1. The sequence now contains three numbers. 0, 1, 1 Now, add 1+1=2. This brings us to four numbers. 0, 1, 1, 2 Add 1 and 2. (1+2=3) 0, 1, 1, 2, 3 Now it gets a bit tricky. Add 2+3=5, so the next number is 5. 0, 1, 1, 2, 3, 5 Continue to add the numbers accordingly. (3+5=8) 0, 1, 1, 2, 3, 5, 8 Proceed. 0, 1, 1, 2, 3, 5, 8, 13, 25, 38, 63, 101, 164...

The set of integers.

It is a sequence on numbers that each number is a sum of the 2 previous numbers. for example, 1,(1+0=)2,(1+2=)3,(2+3=)5,etc. made by fibbonacci.

13, 21 - it is the Fibonacci sequence

NO, its not a Fibonacci Sequence, but it is very close. The Fibonacci Sequence is a series of numbers in which one term is the sum of the previous two terms. The Fibonacci Sequence would go as follows: 0,1,1,2,3,5,8,13,21,..... So 0+1=1, 1+1=2, 1+2=3, 2+3=5, ans so on.

1. Start with any two numbers . ( Use 0 and 1 to get the standard sequence) 2. 0 1 Rule: Add each pair of numbers to get the next term 0 1 1 ( add 0 + 1 to get 1) 0 1 1 2 ( add 1 + 1 to get 2) 0 1 1 2 3 (1+2 = 3) 0 1 1 2 3 5 (2 + 3 = 5) 0 1 1 2 3 5 8 and so on forever.

the Fibonacci sequence: 0 1 1 2 3 5 8 13 21 34 55 89 144 ... 0+1=1 1+1=2 1+2=3 you add up the first two numbers and the equal the next and so on... kofie2468

I think its 5

A huge number. 0 + 1 + 2 = 3 0 + 2 + 1 = 3 1 + 0 + 2 = 3 1 + 2 + 0 = 3 2 + 0 + 1 = 3 2 + 1 + 0 = 3 -0 + 1 + 2 = 3 -0 + 2 + 1 = 3 1 - 0 + 2 = 31 + 2 - 0 = 32 - 0 + 1 = 32 + 1 - 0 = 3 0 - 1 + 3 = 2 0 + 3 - 1 = 2 -1 + 0 + 3 = 2 -1 + 3 + 0 = 2 3 + 0 - 1 = 2 3 - 1 + 0 = 2 -0 - 1 + 3 = 2-0 + 3 - 1 = 2-1 - 0 + 3 = 2-1 + 3 - 0 = 23 - 0 - 1 = 23 - 1 - 0 = 2 0 - 2 + 3 = 1 0 + 3 - 2 = 1 -2 + 0 + 3 = 1 -2 + 3 + 0 = 1 3 + 0 - 2 = 1 3 - 2 + 0 = 1 -0 - 2 + 3 = 1-0 + 3 - 2 = 1-2 - 0 + 3 = 1-2 + 3 - 0 = 13 - 0 - 2 = 13 - 2 - 0 = 1 1 + 2 - 3 = 0 1 - 3 + 2 = 0 2 + 1 - 3 = 0 2 - 3 + 1 = 0 -3 + 1 + 2 = 0 -3 + 2 + 1 = 0 For each of these equations there is a counterpart in which all signs have been switched. For example 0 + 1 + 2 = 3 gives -0 - 1 - 2 = -3and so on. Now, all of the above equations has three numbers on the left and one on the right. Each can be converted to others with two numbers on each side. For example:the equation 0 + 1 + 2 = 3 gives rise to0 + 1 = 3 - 20 + 1 = -2 + 30 + 2 = 3 - 10 + 2 = -1 + 31 + 2 = 3 - 01 + 2 = -0 + 3-0 + 1 = 3 - 2-0 + 1 = -2 + 3-0 + 2 = 3 - 1-0 + 2 = -1 + 31 + 2 = 3 + 01 + 2 = +0 + 3 As you can see, the number of equations is huge!

/* the sequence printed is Fibonacci's sequence, each element is calculated as a sum of two previous elements */#includeint main(){int i;int n;int a0=0;int a1=1;printf("How many elements do you want to print? ");scanf("%d",&n);printf("0 ");if (n > 0)printf("1 ");for (i = 2; i

If the sequence of the digits is important ... 1-2-3 and 3-2-1 are different ... then there are 10*9*8 = 720 of them. If the sequence doesn't matter ... 1-2-3 and 2-3-1 and 3-1-2 are all the same ... then there are only 720/6 = 120 because 3 things can be ordered 1*2*3 = 6 ways.