This sequence consists of the primes >3 for which A177330 is zero. k is even when p=1 (mod 6); k is odd when p=5 (mod 6). This problem is similar to that of finding Sierpinski and Riesel numbers (see A076336 and A076337). Compositeness of (p*2^k-1)/3 for all even or all odd k is established by finding a finite set of primes such that at least one member of the set divides each term. For p <= 7797, the set of primes is {3,5,7,13}.