This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A228004 #27 Apr 03 2023 10:36:13 %S A228004 4,16,25,32,49,81,121,128,169,243,256,289,361,529,625,841,961,1024, %T A228004 1369,1681,1849,2048,2187,2209,2401,2809,3125,3481,3721,4489,5041, %U A228004 5329,6241,6561,6889,7921,8192,9409,10201,10609,11449,11881,12769,14641,16129 %N A228004 Prime powers p^m with m >= 2 which are not the sum of consecutive cubes. %H A228004 Chai Wah Wu, <a href="/A228004/b228004.txt">Table of n, a(n) for n = 1..10137</a> %H A228004 K. S. Brown, <a href="http://www.mathpages.com/home/kmath147.htm">Sum of Consecutive Nth Powers Equals an Nth Power</a> %H A228004 G. L. Honaker, Jr. and Chris Caldwell, <a href="https://t5k.org/curios/cpage/24463.html">Prime Curios! 97</a> %e A228004 9 is not in the sequence since it is equal to 1^3 + 2^3. %o A228004 (Magma) lst:=[]; r:=26; c:=r^3; for n in [2..r] do for m in [n-1..0 by -1] do s:=((n^2+n)^2-(m^2+m)^2)/4; if s gt c then break; end if; if not s in lst then Append(~lst, s); end if; end for; end for; lst:=Sort(lst); [p: p in [2..c] | not IsPrime(p) and IsPrimePower(p) and not p in lst]; %Y A228004 Cf. A025475, A217843. %K A228004 nonn %O A228004 1,1 %A A228004 _Arkadiusz Wesolowski_, Aug 07 2013