A counting problem

Правка en1, от umsh1ume, 2016-08-28 21:00:40

In how many ways can we make n digit number from 1,2 and 3 such that no continuous triplet has distinct integers.Ex: 21231122 will not be counted but 22113311122 will be. i.e. 123 or 321 or 312 or 213 or 132 or 231 should not be present in the number

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский umsh1ume 2016-08-28 21:00:40 269 Initial revision (published)