1 paper
Cathal O'Sullivan, Jonathan P. Sorenson, Aryn Stahl
We present and analyze an algorithm to enumerate all integers n≤x that can be written as the sum of consecutive kth powers of primes, for k>1. We show that the number of s…