cp's OEIS Frontend

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.

A140251 Smallest cubes > terms in A066525.

Original entry on oeis.org

512, 17576, 35287552, 107171875, 3029741623, 3666512088, 7233848504, 10417365504, 11194326053, 12008989000, 25908060079, 36528273432, 40707584000, 47555965367, 49958012987, 63664587657, 84258095104, 96386901625, 573441954112, 973242271000
Offset: 1

Views

Author

Enoch Haga, May 15 2008

Keywords

Examples

			The cube just greater than 503 is 512; a(1) in this sequence.
		

References

  • Suggested by Carlos Rivera's Prime Puzzles & Problems Connection, Puzzle 443 (which asks if the SCCP can be a cube or a prime cube).

Crossrefs

Formula

For each of the terms in A066525 (which are SCCP, sums of cubes of consecutive primes), find the cube just exceeding the term.

Extensions

a(11)-a(20) from Nathaniel Johnston, Apr 21 2011