[理工] [離散] 排列組合

[juan19283746 (小阮)]

In how many ways can be the integer 1 2 3 ... n be arrangement in

a line , so that none of the patterns 12 , 23 , 34 ... n-1 n  occurs?



嘗試用排容解  但是似乎算不出來

請高手指教  謝謝

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 114.40.93.186