I have modified the statement of the homework so that it asks you to write a program that generates all numbers that do not satisfy Goldbach's other conjecture and to demonstrate that it works by taking the first two elements.

Write Haskell and Python programs that generate all non-prime odd numbers n so that for each there is no prime p and integer k > 0 such that n = p + 2 * k^2. 

If your program is called goldbach_counter_examples, demonstrate that it works as follows.

> take 2 goldbach_counter_examples

[5777, 5993]