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.

A055078 Write n as a sum of terms of the form (p^2-1)/24 where p is a prime > 4; sequence gives those n which require at least 4 terms.

Original entry on oeis.org

33, 68, 88, 103, 138, 143, 173, 183, 198, 208, 243, 253, 278, 298, 308, 313, 348, 363, 373, 383, 403, 413, 418, 453, 468, 473, 488, 523, 528, 558, 563, 578, 583, 593, 608, 628, 638, 643, 658, 663, 668, 693, 698, 733, 748, 753, 758, 763, 768, 778, 803, 838
Offset: 1

Views

Author

Jud McCranie, Jun 20 2000

Keywords

Comments

Chowla conjectures that all numbers are the sum of no more than four terms of the form (p^2-1)/24 where p is a prime > 4.

References

  • R. K. Guy, Unsolved Problems In Number Theory, section C20.

Crossrefs

Cf. A024702.