I didn't really double check or anything. If any of you know python you can look at it if you want.

Code:

from time import clock
begin = clock()
def prime_comp_sieve(upper):
"""
returns list of len(upper)
0 for prime
1 for composite
"""
nums = [0 for n in range(upper)]
p = 2
while p < int(pow(upper, 0.5) + 1):
for d in xrange(p + p, upper, p):
nums[d] = 1
while True:
p += 1
if not nums[p]:
break
return nums
nums = prime_comp_sieve(10**7)
primes = [n for n, x in enumerate(nums[:65]) if x == 0][2:]
all_comp_lists = [str(n) + ' ' if x == 1 else '*'
for n, x in enumerate(nums)]
all_comp_lists = [map(int, sub_list.split())
for sub_list in ''.join(all_comp_lists).split('*')]
all_comp_lists = [sub_list for sub_list in all_comp_lists
if len(sub_list) >= 8]
for comp_list in all_comp_lists:
for x in range(len(comp_list) - 7):
sub_comp_list = comp_list[x:x+8]
found_comp_list = True
for p in primes:
found_multiple = False
for c in sub_comp_list:
if c % p == 0:
found_multiple = True
break
if not found_multiple:
found_comp_list = False
break
if found_comp_list:
print ','.join(map(str, comp_list))
break
if found_comp_list:
break
print 'completed in: %s seconds' % int(clock() - begin)