def is_num_keith(x):
    # Convert number to its digits
    digits = [int(d) for d in str(x)]
    n = len(digits)
    
    if n == 1:
        return True
    
    # Generate Keith sequence
    seq = digits[:]
    
    while seq[-1] < x:
        next_val = sum(seq[-n:])
        seq.append(next_val)
    
    return seq[-1] == x