# [Stax](https://github.com/tomtheisen/stax), <s>26</s> 24 [bytes](https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax)

	Ç╕SôεPN^:·░ßⁿ {@ÿ}Ü╫╣1╣X

[Run and debug it](http://stax.tomtheisen.com/#p=80b85393ee504e5e3afab0e1fc207b40987d9ad7b931b958&i=[1,10]%0A[0,1]%0A[2,1]%0A[2,3]%0A%0A[61,86]%0A[75,90]%0A[34,74]%0A[59,81]%0A[84,85]%0A%0A[19,46]+%0A[60,81]+%0A[41,42]++%0A[13,81]+%0A[31,50]++%0A[15,42]%0A[94,99]+%0A[72,66]%0A[3189,826]++%0A%0A[15,3]%0A[22,51]+%0A[74,85]+%0A[27,31]+%0A%0A[123,0]++%0A[111,0]+%0A[111,222]+++++%0A%0A[33345,692]%0A[3894621507,5981921703]%0A[765432099,111111111]%0A%0A[1976,123]%0A&a=1&m=2)

**Explanation**

    E{b+}99*L{E%2>|cd_E:-u%1=!C_Qf    # Full program, unpacked, implicit input
    E                                 # Push all elements from array onto stack.
     {b+}99*L                         # Generate the first 99 numbers of the  Fibonacci sequence given the input
             {                   f    # Loop through all Fibonacci elements
              E                       # Array of decimal digit
               %2>                    # Does the array have at least 3 digits
                  |c                  # Assume Truthy past this point
                    d                 # discard top of stack
                     _E               # Copy the current element of the Fibonacci sequence and Digitize it
                      :-              # Pairwise difference of array.
                        :u            # Is there exactly 1 unique number
                            !C        # Flip the comparison, if truthy proceed
                              _Q      # Copy the current element of the Fibonacci sequence and Peek and print with a newline.

Not as short as I would like it and can probably be golfed a bit more, but it works.