The k generalized Fibonacci sequence F (k) n n resembles the Fi- bonacci sequence in that it starts with 0;:::; 0; 1 (k terms) and each term af- terwards is the sum of the k preceding terms. In this paper, we are interested in nding powers of two that appear in k generalized Fibonacci sequences; i.e., we study the Diophantine equation F (k) n = 2 m in positive integers n;k;m