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.

A273877 Least positive integer k such that k^3 + (k+1)^3 + ... + (k+n-2)^3 + (k+n-1)^3 is the sum of two positive cubes. a(n) = 0 if no solution exists.

Original entry on oeis.org

0, 1, 11, 2, 10, 31, 6, 70, 4, 42, 4, 4, 15, 174, 6, 2, 70, 556, 18, 378, 2, 119, 4277, 6, 8, 5, 33111, 3, 2088, 61, 7, 7, 145, 417, 8, 13, 9, 1424, 23, 18, 106, 101, 7, 39, 138, 276, 13353, 48, 1, 31, 645, 2981, 107627, 34, 155, 11, 8, 214, 62, 25, 103, 28
Offset: 1

Views

Author

Altug Alkan, Jun 02 2016

Keywords

Comments

What is the most repeated value of this sequence?

Examples

			a(3) = 11 because 11^3 + 12^3 + 13^3 = 7^3 + 17^3.
		

Crossrefs

Extensions

a(10)-a(62) from Giovanni Resta, Jun 03 2016
a(49) corrected by Chai Wah Wu, Jun 07 2016