Juggler Sequence is a series of integer number in which the first term starts with a positive integer number a and the remaining terms are generated from the immediate previous term using the below recurrence relation :
Juggler Sequence starting with number 3:
5, 11, 36, 6, 2, 1
Juggler Sequence starting with number 9:
9, 27, 140, 11, 36, 6, 2, 1
Given a number n we have to print the Juggler Sequence for this number as the first term of the sequence.
Input: 9 Output: 9, 27, 140, 11, 36, 6, 2, 1 We start with 9 and use above formula to get next terms. Input: 6 Output: 6, 2, 1
3 5 11 36 6 2 1 9 27 140 11 36 6 2 1
- The terms in Juggler Sequence first increases to a peak value and then starts decreasing.
- The last term in Juggler Sequence is always 1.
This article is contributed by Harsh Agarwal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Minimum operations required to transform a sequence of numbers to a sequence where a[i]=a[i+2]
- k-th missing element in increasing sequence which is not present in a given sequence
- Look-and-Say Sequence
- Sum of the sequence 2, 22, 222, .........
- Sylvester's sequence
- Golomb sequence
- Connell Sequence
- k-th number in the Odd-Even sequence
- Recaman's sequence
- Gould's Sequence
- Farey Sequence
- Aliquot Sequence
- Padovan Sequence
- Sequence Points in C | Set 1
- Baum Sweet Sequence