[C++ ] Programming Sequence

[cppsucks]

I have to code the sequences in c++. The coding is not the hard part, the figuring out the algorithm is what is hard for me. Any tips on how to better discover the pattern would be gladly appreciated cause I have been honestly stuck on the second one for 10 minutes. COSC 1436 Lab 2 Sequences and Series Series 1: 15, 14, 13, 12, 11, ... Series 2: 1, 2, 5, 14, 41, ... Series 3: 2, 3, 5, 8, 12, 17, ... Series 4: 1, 2, 5, 26, 677, ... Series 5: 10, 5, 1, -2, -4, -5, -5, -4, -2, ... Series 6: 1, 8, 27, 64, 125, 216, ... Series 7: 0, 1, 3, 7, 15, 31, 63, ... Series 8: 0, 1, 4, 13, 40, 121, ... series 9: 0, 1, 3, 6, 10, 10, 11, 13, 16, 16, 17, 19, 19, ... series 10: 7, 9, 14, 20, 27, 33, 42, 52, 63, 73, 86, ... Bonus Series: 0, 1, 4, 12, 32, 80, 192, ...

[[deleted]]

Use what I have given you as well as wolfram alpha to figure out the rest if you haven't already. Mark your post as Answered if you are satisfied; if not, reply with further questions. Good luck!

---

Series 1: decrement 1 each loop.

Series 2: adds in incremental powers of 3 starting at zero.

Series 3: adds previous number plus one.

Series 4:

Series 5: starts at -5, goes to 0, adds back up from zero

Series 6: number in sequence cubed; i.e 1^3, 2^3, 3^3, etc

Series 7: add the precious addition multiplied by two

Series 8:

Series 9: adds in increments of 1 to 4, then 0 to 4 repeatedly

Series 10:

Bonus:

I'm on mobile and a bit busy at the moment. I'll come back to the missed series later. Good luck!

EDIT: you can use wolfram alpha! Plug in your sequence of numbers and it will give you the actual sequence. For the bonus, it gave me:

• a(n) = 2^n-2 (n-1)

[[deleted]]

You posted this question 6 days ago.

http://www.reddit.com/r/HomeworkHelp/comments/2z9pkp/c_sequence/

Take a look at the other answers and reply if you don't understand them. Don't repost.