We call number as funny if it divisible by sum its digits $+1$.(for example $ 1+2+1|12$ ,so $12$ is funny) What is maximum number of consecutive funny numbers ?

[i] O. Podlipski [/i]
1. **Understanding the Problem:**
   We need to find the maximum number of consecutive funny numbers. A number \( n \) is funny if it is divisible by the sum of its digits plus one, i.e., \( n \) is funny if \( n \mod (S(n) + 1) = 0 \), where \( S(n) \) is the sum of the digits of \( n \).

2. **Exploring Modulo Properties:**
   Let's consider the properties of numbers modulo 3. The sum of the digits of a number \( n \) modulo 3 is congruent to \( n \mod 3 \). This is because the sum of the digits of a number and the number itself are congruent modulo 3.

3. **Analyzing the Contradiction:**
   Suppose we have a sequence of consecutive funny numbers. Let's denote these numbers as \( n, n+1, n+2, \ldots, n+k \). For each number \( n+i \) in this sequence, it must be true that \( n+i \) is divisible by \( S(n+i) + 1 \).

4. **Considering \( n \equiv 2 \pmod{2} \):**
   If \( n \equiv 2 \pmod{2} \), then \( n \) is even. Let's examine the numbers \( n, n+1, n+2 \):
   - For \( n \), since it is even, \( S(n) \) is also even. Therefore, \( S(n) + 1 \) is odd.
   - For \( n+1 \), since it is odd, \( S(n+1) \) is odd. Therefore, \( S(n+1) + 1 \) is even.
   - For \( n+2 \), since it is even, \( S(n+2) \) is even. Therefore, \( S(n+2) + 1 \) is odd.

5. **Checking Divisibility:**
   - \( n \) is divisible by \( S(n) + 1 \).
   - \( n+1 \) is divisible by \( S(n+1) + 1 \).
   - \( n+2 \) is divisible by \( S(n+2) + 1 \).

6. **Finding the Maximum Sequence:**
   Let's check the sequence \( 12, 13, 14 \):
   - For \( 12 \), \( S(12) = 1 + 2 = 3 \). \( 12 \mod (3 + 1) = 12 \mod 4 = 0 \). So, 12 is funny.
   - For \( 13 \), \( S(13) = 1 + 3 = 4 \). \( 13 \mod (4 + 1) = 13 \mod 5 = 3 \). So, 13 is not funny.
   - For \( 14 \), \( S(14) = 1 + 4 = 5 \). \( 14 \mod (5 + 1) = 14 \mod 6 = 2 \). So, 14 is not funny.

   Therefore, the sequence \( 12, 13, 14 \) does not work. Let's try another sequence:
   - For \( 21 \), \( S(21) = 2 + 1 = 3 \). \( 21 \mod (3 + 1) = 21 \mod 4 = 1 \). So, 21 is not funny.
   - For \( 22 \), \( S(22) = 2 + 2 = 4 \). \( 22 \mod (4 + 1) = 22 \mod 5 = 2 \). So, 22 is not funny.
   - For \( 23 \), \( S(23) = 2 + 3 = 5 \). \( 23 \mod (5 + 1) = 23 \mod 6 = 5 \). So, 23 is not funny.

   We can see that finding a sequence of more than one funny number is challenging. Therefore, the maximum number of consecutive funny numbers is likely 1.

The final answer is \(\boxed{1}\).