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 A140251 #8 Feb 06 2019 03:28:15 %S A140251 512,17576,35287552,107171875,3029741623,3666512088,7233848504, %T A140251 10417365504,11194326053,12008989000,25908060079,36528273432, %U A140251 40707584000,47555965367,49958012987,63664587657,84258095104,96386901625,573441954112,973242271000 %N A140251 Smallest cubes > terms in A066525. %D A140251 Suggested by Carlos Rivera's Prime Puzzles & Problems Connection, Puzzle 443 (which asks if the SCCP can be a cube or a prime cube). %H A140251 Nathaniel Johnston, <a href="/A140251/b140251.txt">Table of n, a(n) for n = 1..1000</a> %H A140251 Carlos Rivera, <a href="https://www.primepuzzles.net/puzzles/puzz_443.htm">Puzzle 443. Sum of cubes of consecutive primes</a>, The Prime Puzzles and Problems Connection. %F A140251 For each of the terms in A066525 (which are SCCP, sums of cubes of consecutive primes), find the cube just exceeding the term. %e A140251 The cube just greater than 503 is 512; a(1) in this sequence. %Y A140251 Cf. A066525, A098563, A140250. %K A140251 nonn %O A140251 1,1 %A A140251 _Enoch Haga_, May 15 2008 %E A140251 a(11)-a(20) from _Nathaniel Johnston_, Apr 21 2011