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.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Sum of the sequence 2, 22, 222, .........
- Look-and-Say Sequence
- k-th number in the Odd-Even sequence
- Connell Sequence
- Aronson's Sequence
- Gijswijt's Sequence
- Alcuin's Sequence
- Gould's Sequence
- Find F(n) when F(i) and F(j) of a sequence are given
- Increasing sequence with given GCD
- Aliquot Sequence
- Padovan Sequence
- Farey Sequence
- Beatty sequence
- Sylvester's sequence
- Recaman's sequence
- Golomb sequence
- Smarandache-Wellin Sequence
- G-Fact 21 | Collatz Sequence
- Program to find sum of the given sequence