Use a pumping lemma to be able to prove if the language below is not regular.

{b,ab,bc,aab,abc,bcc,aaab,aabc,abcc,bccc,....}