MathDB

Problems(2)

6 VIP chairs in a movie theatre

Source: 2020 Dürer Math Competition Finals Day2 E15 https://artofproblemsolving.com/community/c1622639_2020_

1/7/2022
In a movie theatre there are 66 VIP chairs labelled from 11 to 66. We call a few consecutive vacant chairs a block. In the online VIP seat reservation process the reservation of a seat consists of two steps: in the first step we choose the block, in the second step we reserve the first, last or middle seat (in case of a block of size even this means the middle chair with the smaller number) of that block. (In the second step the online system offers the three possibilities even though they might mean the same seat.) Benedek reserved all seats at some screeining. In how many ways could he do it if we distinguish two reservation if there were a step when Benedek chose a different option?
For instance, if the seats 1 1 and 66 are reserved, then there are two blocks, the first one consists of the seat 1 1, the second block consists of the seats 3,43, 4 and 55. Two reservation orders are different if there is a chair that was reserved in a different step, or there is a chair that was reserved with different option (first, last or middle). So if there were 22 VIP chairs, then the answer would have been 99.
combinatorics
f(n) = (p_1-1)^{k_1+1}(p_2-1)^{k_2+1}...(pt-1)^{k_t+1}

Source: 2020 Dürer Math Competition Finals Day2 E+15 https://artofproblemsolving.com/community/c1622639_2020_

1/7/2022
The function ff is defined on positive integers : if nn has prime factorization p1k1p2k2...ptktp^{k_1}_{1} p^{k_2}_{2} ...p^{k_t}_{t} then f(n)=(p11)k1+1(p21)k2+1...(pt1)kt+1f(n) = (p_1-1)^{k_1+1}(p_2-1)^{k_2+1}...(p_t-1)^{k_t+1}. If we keep using this function repeatedly, starting from any positive integer nn, we will always get to 11 after some number of steps. What is the smallest integer nn for which we need exactly 66 steps to get to 11?
number theory